Sciweavers

15 search results - page 2 / 3
» tableaux 2005
Sort
View
TABLEAUX
2005
Springer
13 years 10 months ago
Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic
Abstract. We present a clausal connection calculus for first-order intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the character...
Jens Otten
TABLEAUX
2005
Springer
13 years 10 months ago
A Calculus for Type Predicates and Type Coercion
We extend classical first-order logic with subtyping by type predicates and type coercion. Type predicates assert that the value of a term belongs to a more special type than the ...
Martin Giese
TABLEAUX
2005
Springer
13 years 10 months ago
The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic
The Intuitionistic Logic Theorem Proving (ILTP) Library provides a platfom for testing and benchmarking theorem provers for first-order intuitionistic logic. It includes a collect...
Thomas Raths, Jens Otten, Christoph Kreitz
TABLEAUX
2005
Springer
13 years 10 months ago
A Tableau Calculus with Automaton-Labelled Formulae for Regular Grammar Logics
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are simi...
Rajeev Goré, Linh Anh Nguyen
TABLEAUX
2005
Springer
13 years 10 months ago
A Tableau Algorithm for Description Logics with Concrete Domains and GCIs
In description logics (DLs), concrete domains are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extensio...
Carsten Lutz, Maja Milicic