45 search results - page 2 / 9 » Elimination of Self-Resolving Clauses |
SAT
2009
Springer
14 years 1 months ago
2009
Springer
Most current propositional SAT solvers apply resolution at various stages to derive new clauses or simplify existing ones. The former happens during conflict analysis, while the l...
CADE
1999
Springer
13 years 11 months ago
1999
Springer
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
LOPSTR
2005
Springer
14 years 12 days ago
2005
Springer
A variable is local if it occurs in a clause body but not in its head. Local variables appear naturally in practical logic programming, but they complicate several aspects such as ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization ...