TCS
2008
13 years 11 months ago
2008
Let R be a resolution refutation, given as a sequence of clauses without explicit description of the underlying dag. Then, it is NPcomplete to decide whether R is a regular resolu...
LMCS
2006
13 years 11 months ago
2006
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing tha...
CADE
1999
Springer
14 years 3 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 ...
DNA
2003
Springer
14 years 4 months ago
2003
Springer
In molecular resolution refutation, the detection of empty clauses is important. We propose a rolling circle amplification-based detection method for resolution refutation. The ro...