Sciweavers

7988 search results - page 28 / 1598
» A Useful Undecidable Theory
Sort
View
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 8 months ago
Model Checking Synchronized Products of Infinite Transition Systems
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...
Stefan Wöhrle, Wolfgang Thomas
SIAMCOMP
2008
100views more  SIAMCOMP 2008»
13 years 8 months ago
On the Complexity of Verifying Consistency of XML Specifications
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsiste...
Marcelo Arenas, Wenfei Fan, Leonid Libkin
LPAR
2010
Springer
13 years 7 months ago
Polite Theories Revisited
The classic method of Nelson and Oppen for combining decision procedures requires the theories to be stably-infinite. Unfortunately, some important theories do not fall into this...
Dejan Jovanovic, Clark Barrett
CORR
2011
Springer
140views Education» more  CORR 2011»
13 years 16 days ago
Bias-Driven Revision of Logical Domain Theories
The theory revision problem is the problem of how best to go about revising a deficient domain theory using information contained in examples that expose inaccuracies. In this pa...
Ronen Feldman, Moshe Koppel, Alberto Maria Segre
WWW
2004
ACM
14 years 9 months ago
A proposal for an owl rules language
Although the OWL Web Ontology Language adds considerable expressive power to the Semantic Web it does have expressive limitations, particularly with respect to what can be said ab...
Ian Horrocks, Peter F. Patel-Schneider