Sciweavers

616 search results - page 37 / 124
» Bounded Model Checking with Description Logic Reasoning
Sort
View
SCP
2010
155views more  SCP 2010»
13 years 7 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 9 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari
SIGSOFT
2006
ACM
14 years 9 months ago
SYNERGY: a new algorithm for property checking
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
Bhargav S. Gulavani, Thomas A. Henzinger, Yamini K...
WISE
2005
Springer
14 years 2 months ago
A Formal Ontology Reasoning with Individual Optimization: A Realization of the Semantic Web
Abstract. Answering a query over a group of RDF data pages is a trivial process. However, in the Semantic Web, there is a need for ontology technology. Consequently, OWL, a family ...
Pakornpong Pothipruk, Guido Governatori
LPNMR
2004
Springer
14 years 2 months ago
Towards Automated Integration of Guess and Check Programs in Answer Set Programming
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
Thomas Eiter, Axel Polleres