Sciweavers

154 search results - page 13 / 31
» Proof Complexity of Non-classical Logics
Sort
View
CSL
2001
Springer
15 years 2 months ago
On a Generalisation of Herbrand's Theorem
In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the ...
Matthias Baaz, Georg Moser
LFCS
2009
Springer
15 years 4 months ago
Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm
We present FixIt(ALC), a novel procedure for deciding knowledge base (KB) satisfiability in the Fuzzy Description Logic (FDL) ALC. FixIt(ALC) does not search for tree-structured m...
Uwe Keller, Stijn Heymans
TABLEAUX
2009
Springer
15 years 4 months ago
Generic Modal Cut Elimination Applied to Conditional Logics
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the ...
Dirk Pattinson, Lutz Schröder
LICS
2006
IEEE
15 years 4 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
CADE
2007
Springer
15 years 1 months ago
The Heterogeneous Tool Set (Hets)
Abstract. Heterogeneous specification becomes more and more important because complex systems are often specified using multiple viewpoints, involving multiple formalisms. Moreover...
Till Mossakowski, Christian Maeder, Klaus Lüt...