Sciweavers

TABLEAUX
1999
Springer
14 years 3 months ago
Tableau Calculi for Hybrid Logics
Hybrid logics were proposed in 15 as a way of boosting the expressivity of modal logics via a novel mechanism: adding labels for states in Kripke models and viewing these labels as...
Miroslava Tzakova
TABLEAUX
1999
Springer
14 years 3 months ago
DLP and FaCT
Peter F. Patel-Schneider, Ian Horrocks
TABLEAUX
1999
Springer
14 years 3 months ago
A Tableau Calculus for Pronoun Resolution
Appeared in: N.V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX’99), Lecture Notes in Artificial Intelligence 1617, Springer, pages 2...
Christof Monz, Maarten de Rijke
TABLEAUX
1999
Springer
14 years 3 months ago
linTAP: A Tableau Prover for Linear Logic
Abstract. linTAP is a tableau prover for the multiplicative and exponential fragment M?LL of Girards linear logic. It proves the validity of a given formula by constructing an anal...
Heiko Mantel, Jens Otten
TABLEAUX
1999
Springer
14 years 3 months ago
Applying an ALC ABox Consistency Tester to Modal Logic SAT Problems
In this paper we present the results of applying HAM-ALC, a description logic system for ALCNR, to modal logic SAT problems.
Volker Haarslev, Ralf Möller
TABLEAUX
1999
Springer
14 years 3 months ago
The Non-Associative Lambek Calculus with Product in Polynomial Time
We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open prolem...
Philippe de Groote
TABLEAUX
1999
Springer
14 years 3 months ago
KtSeqC: System Description
Vijay Boyapati, Rajeev Goré
TABLEAUX
1999
Springer
14 years 3 months ago
Merge Path Improvements for Minimal Model Hyper Tableaux
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
Peter Baumgartner, Joseph Douglas Horton, Bruce Sp...
TABLEAUX
1999
Springer
14 years 3 months ago
Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?
Abstract. We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π0 1 -formulae and Π0 2 -...
Stéphane Demri