Sciweavers

75 search results - page 5 / 15
» Abstract Interpretation of Proofs: Classical Propositional C...
Sort
View
LOGCOM
2002
124views more  LOGCOM 2002»
13 years 10 months ago
Modal Logics Between Propositional and First-order
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
Melvin Fitting
TABLEAUX
2000
Springer
14 years 2 months ago
A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...
Alberto Artosi, Guido Governatori, Antonino Rotolo
CORR
2011
Springer
153views Education» more  CORR 2011»
13 years 5 months ago
Proof-Theoretic Soundness and Completeness
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...
Robert Rothenberg
LICS
1991
IEEE
14 years 2 months ago
On the Deduction Rule and the Number of Proof Lines
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
Maria Luisa Bonet, Samuel R. Buss
CADE
2008
Springer
14 years 11 months ago
randoCoP: Randomizing the Proof Search Order in the Connection Calculus
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
Thomas Raths, Jens Otten