Sciweavers

429 search results - page 21 / 86
» Theorem Proving Languages for Verification
Sort
View
CADE
2007
Springer
14 years 9 months ago
First Order Reasoning on a Large Ontology
We present results of our work on using first order theorem proving to reason over a large ontology (the Suggested Upper Merged Ontology ? SUMO), and methods for making SUMO suita...
Adam Pease, Geoff Sutcliffe
IPL
2006
109views more  IPL 2006»
13 years 8 months ago
Knuth-Bendix completion of theories of commuting group endomorphisms
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
Aaron Stump, Bernd Löchner
TPHOL
1999
IEEE
14 years 26 days ago
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
Markus Wenzel
MFPS
1991
14 years 3 days ago
Decomposition of Domains
The problem of decomposing domains into sensible factors is addressed and solved for the case of dI-domains. A decomposition theorem is proved which allows the represention of a l...
Achim Jung, Leonid Libkin, Hermann Puhlmann
DLOG
2006
13 years 10 months ago
Description logic reasoning using the PTTP approach
The goal of this paper is to present how the Prolog Technology Theorem Proving (PTTP) approach can be used for ABox-reasoning. This work presents an inference algorithm over the l...
Zsolt Nagy, Gergely Lukácsy, Péter S...