51 search results - page 3 / 11 » cade 2008 |
CADE
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
CADE
2008
Springer
14 years 11 months ago
2008
Springer
One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This p...
CADE
2008
Springer
14 years 11 months ago
2008
Springer
This paper describes the integration of the ATP support of the TPTPWorld into the Sigma Knowledge Engineering Environment. The result is an interactive knowledge based reasoning en...
CADE
2008
Springer
14 years 25 days ago
2008
Springer
Completion is a general paradigm for applying inferences to generate a canonical presentation of a logical theory, or to semi-decide the validity of theorems, or to answer queries....
CADE
2008
Springer
14 years 25 days ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...