Sciweavers

150 search results - page 27 / 30
» The Stable Models of a Predicate Logic Program
Sort
View
ICLP
1991
Springer
15 years 1 months ago
Nonmonotonic Reasoning with Well Founded Semantics
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...
Luís Moniz Pereira, Joaquim Nunes Apar&iacu...
ECAI
2008
Springer
14 years 11 months ago
A Coherent Well-founded Model for Hybrid MKNF Knowledge Bases
Abstract. With the advent of the Semantic Web, the question becomes important how to best combine open-world based ontology languages, like OWL, with closed-world rules paradigms. ...
Matthias Knorr, José Júlio Alferes, ...
VMCAI
2009
Springer
15 years 4 months ago
LTL Generalized Model Checking Revisited
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
Patrice Godefroid, Nir Piterman
DKE
2010
167views more  DKE 2010»
14 years 9 months ago
The consistency extractor system: Answer set programs for consistent query answering in databases
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
Mónica Caniupán Marileo, Leopoldo E....
TACAS
2012
Springer
275views Algorithms» more  TACAS 2012»
13 years 5 months ago
Pushdown Model Checking for Malware Detection
The number of malware is growing extraordinarily fast. Therefore, it is important to have efficient malware detectors. Malware writers try to obfuscate their code by different tec...
Fu Song, Tayssir Touili