Sciweavers

103 search results - page 2 / 21
» Proof Systems for Effectively Propositional Logic
Sort
View
SAT
2010
Springer
178views Hardware» more  SAT 2010»
13 years 11 months ago
Proof Complexity of Propositional Default Logic
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...
Olaf Beyersdorff, Arne Meier, Sebastian Mülle...
APAL
1999
88views more  APAL 1999»
13 years 7 months ago
A Simple Propositional S5 Tableau System
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
Melvin Fitting
CADE
2001
Springer
14 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...
AISC
1998
Springer
13 years 11 months ago
Optimising Propositional Modal Satisfiability for Description Logic Subsumption
Effective optimisation techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics. Because of the corre...
Ian Horrocks, Peter F. Patel-Schneider
CSL
2010
Springer
13 years 8 months ago
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
Yijia Chen, Jörg Flum