2585 search results - page 143 / 517 » Automating Coherent Logic |
136
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
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...
149
click to vote
CADE
2004
Springer
16 years 6 months ago
2004
Springer
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...
176
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
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 ...
154
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
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...
176
click to vote
TIME
2009
IEEE
16 years 1 months ago
2009
IEEE
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...