TABLEAUX
2005
Springer
14 years 5 months ago
2005
Springer
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...
TABLEAUX
2005
Springer
14 years 5 months ago
2005
Springer
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...
TABLEAUX
2005
Springer
14 years 5 months ago
2005
Springer
This paper presents the planning system Pdk (Planning with Domain Knowledge), based on the translation of planning problems into Linear Time Logic theories, in such a way that fin...
TABLEAUX
2005
Springer
14 years 5 months ago
2005
Springer
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...
TABLEAUX
2005
Springer
14 years 5 months ago
2005
Springer
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
TABLEAUX
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of thes...
TABLEAUX
2005
Springer
14 years 5 months ago
2005
Springer
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...
TABLEAUX
2005
Springer
14 years 5 months ago
2005
Springer
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 ...
TABLEAUX
2005
Springer
14 years 5 months ago
2005
Springer
TABLEAUX
2005
Springer
14 years 5 months ago
2005
Springer
For applications of first-order automated theorem provers in a wider verification context it is essential to provide a means of presenting and checking automatically found proofs...