Sciweavers

2022 search results - page 87 / 405
» Complexity of Non-Monotonic Logics
Sort
View
112
Voted
VAMOS
2008
Springer
15 years 2 months ago
How complex is my Product Line? The case for Variation Point Metrics
Software Product Lines aim at capturing the variability and commonality of a family of related programs that share a common set of assets. Variation points capture variability on ...
Roberto E. Lopez-Herrejon, Salvador Trujillo
105
Voted
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
14 years 11 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
87
Voted
IAT
2009
IEEE
15 years 7 months ago
Computing Information Minimal Match Explanations for Logic-Based Matchmaking
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
137
Voted
JAPLL
2010
179views more  JAPLL 2010»
14 years 11 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
110
Voted
IPPS
2002
IEEE
15 years 5 months ago
Achieving Scalability in Parallel Tabled Logic Programs
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...