Sciweavers

257 search results - page 16 / 52
» The Complexity of Model Checking for Propositional Default L...
Sort
View
AGP
2003
IEEE
14 years 27 days ago
Enhancing Disjunctive Logic Programming for Ontology Specification
This paper is a presentation of ONTO-DLP, an extension of Disjunctive Logic Programming (DLP) for complex knowledge modelling. ONTO-DLP enhances DLP by constructs coming from othe...
Francesco Calimeri, Stefania Galizia, Massimo Ruff...
CORR
2010
Springer
202views Education» more  CORR 2010»
13 years 7 months ago
The Complexity of Reasoning for Fragments of Autoepistemic Logic
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
Nadia Creignou, Arne Meier, Michael Thomas, Heribe...
CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 7 months ago
Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
Barnaby Martin
CADE
2007
Springer
14 years 8 months ago
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
HYBRID
2003
Springer
14 years 24 days ago
Model Checking LTL over Controllable Linear Systems Is Decidable
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
Paulo Tabuada, George J. Pappas