Sciweavers

13 search results - page 1 / 3
» Modal vs. Propositional Reasoning for model checking with De...
Sort
View
DLOG
2007
14 years 1 months ago
Modal vs. Propositional Reasoning for model checking with Description Logics
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
DLOG
2006
14 years 11 days ago
Model checking the basic modalities of CTL with Description Logic
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
LICS
2005
IEEE
14 years 4 months ago
Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...
Patrice Godefroid, Michael Huth
CADE
2007
Springer
14 years 11 months ago
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
Andrei Voronkov, Juan Antonio Navarro Pérez
DLOG
1998
14 years 9 days ago
Comparing Subsumption Optimizations
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
Ian Horrocks, Peter F. Patel-Schneider