Sciweavers

4617 search results - page 391 / 924
» Automation of Diagrammatic Reasoning
Sort
View
CADE
2001
Springer
16 years 7 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
CADE
2001
Springer
16 years 7 months ago
STRIP: Structural Sharing for Efficient Proof-Search
The STRIP system is a theorem prover for intuitionistic propositional logic with two main characteristics: it deals with the duplication of formulae during proof-search from a fine...
Didier Galmiche, Dominique Larchey-Wendling, Domin...
CADE
2001
Springer
16 years 7 months ago
JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expre...
Stephan Schmitt, Lori Lorigo, Christoph Kreitz, Al...
TIME
2009
IEEE
16 years 1 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...
ICCBR
2009
Springer
16 years 1 months ago
Belief Merging-Based Case Combination
Integrity constraint belief merging aims at producing from several knowledge bases, that may be mutually inconsistent, a synthetic knowledge base satisfying a given integrity const...
Julien Cojan, Jean Lieber