72 search results - page 1 / 15 » Reducing the Derivation of Redundant Clauses in Reasoning Sy... |
IJCAI
1989
13 years 5 months ago
1989
This paper addresses two problems concerning the issue of redundant information in resolution based reasoning systems. The first one deals with the question, how the derivation of...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...
NGC
1998
Springer
13 years 4 months ago
1998
Springer
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
CADE
2011
Springer
12 years 4 months ago
2011
Springer
This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivotsWithIntersection, performs partial regularization, re...
CSL
1995
Springer
13 years 8 months ago
1995
Springer
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...