Sciweavers

2585 search results - page 143 / 517
» Automating Coherent Logic
Sort
View
CADE
2007
Springer
14 years 10 months ago
SRASS - A Semantic Relevance Axiom Selection System
This paper describes the design, implementation, and testing of a system for selecting necessary axioms from a large set also containing superfluous axioms, to obtain a proof of a...
Geoff Sutcliffe, Yury Puzis
CADE
2004
Springer
14 years 10 months ago
The CADE ATP System Competition
The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first-order Automated Theorem Proving systems. CASC-18 was the seventh competition in the CASC se...
Geoff Sutcliffe, Christian B. Suttner
CADE
2001
Springer
14 years 10 months ago
Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics
This paper investigates optimization techniques and data structures exploiting the use of so-called pseudo models. These techniques are applied to speed up TBox and ABox reasoning ...
Anni-Yasmin Turhan, Ralf Möller, Volker Haars...
CADE
2001
Springer
14 years 10 months ago
A New Meta-complexity Theorem for Bottom-Up Logic Programs
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
Harald Ganzinger, David A. McAllester
TIME
2009
IEEE
14 years 4 months ago
Undecidability of Interval Temporal Logics with the Overlap Modality
We investigate fragments of Halpern-Shoham’s interval logic HS involving the modal operators for the relations of left or right overlap of intervals. We prove that most of these...
Davide Bresolin, Dario Della Monica, Valentin Gora...