Sciweavers

367 search results - page 30 / 74
» Temporal Reasoning for Procedural Programs
Sort
View
LICS
2005
IEEE
14 years 2 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
FOIKS
2006
Springer
14 years 11 days ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov
DLOG
2010
13 years 6 months ago
Optimizing Algebraic Tableau Reasoning for SHOQ: First Experimental Results
In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We ...
Jocelyne Faddoul, Volker Haarslev
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
14 years 1 months ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker
FMCAD
2006
Springer
14 years 11 days ago
Thorough Checking Revisited
Recent years have seen a proliferation of 3-valued or capturing abstractions of systems, since these enable verifying both universal and existential properties. Reasoning about suc...
Shiva Nejati, Mihaela Gheorghiu, Marsha Chechik