Sciweavers

3970 search results - page 527 / 794
» A Logic For Causal Reasoning
Sort
View
CADE
2002
Springer
16 years 7 months ago
A New Clausal Class Decidable by Hyperresolution
In this paper we define a new clausal class, called BU, which can be decided by hyperresolution with splitting. We also consider the model generation problem for BU and show that h...
Lilia Georgieva, Ullrich Hustadt, Renate A. Schmid...
CADE
2001
Springer
16 years 7 months ago
Incremental Closure of Free Variable Tableaux
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
Martin Giese
CADE
2001
Springer
16 years 7 months ago
Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
Jörg Lücke
CADE
2001
Springer
16 years 7 months ago
NP-Completeness of Refutability by Literal-Once Resolution
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
Stefan Szeider
CADE
2001
Springer
16 years 7 months ago
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
Xavier Urbain