Sciweavers

300 search results - page 13 / 60
» The Extension Theorem
Sort
View
FOIKS
2006
Springer
13 years 11 months 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
IANDC
2008
81views more  IANDC 2008»
13 years 7 months ago
Universal extensions to simulate specifications
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulat...
Wim H. Hesselink
BIRTHDAY
1997
Springer
13 years 11 months ago
Syntax vs. Semantics on Finite Structures
Abstract. Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a rst-order sentence is preserved b...
Natasha Alechina, Yuri Gurevich
TPHOL
1999
IEEE
13 years 11 months ago
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
Mark Aagaard, Robert B. Jones, Carl-Johan H. Seger
MLQ
2000
51views more  MLQ 2000»
13 years 7 months ago
There is No Low Maximal D.C.E. Degree
We give a corrected proof of an extension of the Robinson Splitting Theorem for the d.c.e. degrees. The purpose of this short paper is to clarify and correct the main result and p...
Marat M. Arslanov, S. Barry Cooper, Angsheng Li