Resolution-Refutation Proofs

2001 ◽  
pp. 53-84
Author(s):  
Monty Newborn
Keyword(s):  
Resolution Refutation

RCA-Based Detection Methods for Resolution Refutation

2004 ◽  
pp. 32-36 ◽  
Author(s):  
In-Hee Lee ◽  
Ji Yoon Park ◽  
Young-Gyu Chai ◽  
Byoung-Tak Zhang
Keyword(s):  
Detection Methods ◽  
Resolution Refutation

scholarly journals DNA Implementation of Theorem Proving with Resolution Refutation in Propositional Logic

2003 ◽  
pp. 156-167 ◽  
Author(s):  
In-Hee Lee ◽  
Ji-Yoon Park ◽  
Hae-Man Jang ◽  
Young-Gyu Chai ◽  
Byoung-Tak Zhang
Keyword(s):  
Theorem Proving ◽  
Propositional Logic ◽  
Resolution Refutation

NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability

2020 ◽  
Vol 30 (7) ◽  
pp. 736-751
Author(s):  
Hans Kleine Büning ◽  
P. Wojciechowski ◽  
K. Subramani
Keyword(s):  
Normal Form ◽  
Conjunctive Normal Form ◽  
Principal Result ◽  
Satisfying Assignment ◽  
Boolean Formulas ◽  
Complete Procedure ◽  
Np Complete ◽  
Resolution Refutation ◽  
Original Formula ◽  
Cnf Formulas

AbstractIn this paper, we analyze Boolean formulas in conjunctive normal form (CNF) from the perspective of read-once resolution (ROR) refutation schemes. A read-once (resolution) refutation is one in which each clause is used at most once. Derived clauses can be used as many times as they are deduced. However, clauses in the original formula can only be used as part of one derivation. It is well known that ROR is not complete; that is, there exist unsatisfiable formulas for which no ROR exists. Likewise, the problem of checking if a 3CNF formula has a read-once refutation is NP-complete. This paper is concerned with a variant of satisfiability called not-all-equal satisfiability (NAE-satisfiability). A CNF formula is NAE-satisfiable if it has a satisfying assignment in which at least one literal in each clause is set to false. It is well known that the problem of checking NAE-satisfiability is NP-complete. Clearly, the class of CNF formulas which are NAE-satisfiable is a proper subset of satisfiable CNF formulas. It follows that traditional resolution cannot always find a proof of NAE-unsatisfiability. Thus, traditional resolution is not a sound procedure for checking NAE-satisfiability. In this paper, we introduce a variant of resolution called NAE-resolution which is a sound and complete procedure for checking NAE-satisfiability in CNF formulas. The focus of this paper is on a variant of NAE-resolution called read-once NAE-resolution in which each clause (input or derived) can be part of at most one NAE-resolution step. Our principal result is that read-once NAE-resolution is a sound and complete procedure for 2CNF formulas. Furthermore, we provide an algorithm to determine the smallest such NAE-resolution in polynomial time. This is in stark contrast to the corresponding problem concerning 2CNF formulas and ROR refutations. We also show that the problem of checking whether a 3CNF formula has a read-once NAE-resolution is NP-complete.

scholarly journals Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings

2009 ◽  
Vol 36 ◽  
pp. 415-469 ◽  
Author(s):  
C. Domshlak ◽  
J. Hoffmann ◽  
A. Sabharwal
Keyword(s):  
Point Of View ◽  
Theoretical Point ◽  
Optimal Plan ◽  
Interesting Phenomenon ◽  
State Spaces ◽  
Planning Task ◽  
Resolution Refutation ◽  
International Planning ◽  
Almost All ◽  
Planning Graph

Planning as satisfiability, as implemented in, for instance, the SATPLAN tool, is a highly competitive method for finding parallel step-optimal plans. A bottleneck in this approach is to *prove the absence* of plans of a certain length. Specifically, if the optimal plan has N steps, then it is typically very costly to prove that there is no plan of length N-1. We pursue the idea of leading this proof within solution length preserving abstractions (over-approximations) of the original planning task. This is promising because the abstraction may have a much smaller state space; related methods are highly successful in model checking. In particular, we design a novel abstraction technique based on which one can, in several widely used planning benchmarks, construct abstractions that have exponentially smaller state spaces while preserving the length of an optimal plan. Surprisingly, the idea turns out to appear quite hopeless in the context of planning as satisfiability. Evaluating our idea empirically, we run experiments on almost all benchmarks of the international planning competitions up to IPC 2004, and find that even hand-made abstractions do not tend to improve the performance of SATPLAN. Exploring these findings from a theoretical point of view, we identify an interesting phenomenon that may cause this behavior. We compare various planning-graph based CNF encodings F of the original planning task with the CNF encodings F_abs of the abstracted planning task. We prove that, in many cases, the shortest resolution refutation for F_abs can never be shorter than that for F. This suggests a fundamental weakness of the approach, and motivates further investigation of the interplay between declarative transition-systems, over-approximating abstractions, and SAT encodings.

scholarly journals Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space

2021 ◽  
Vol 30 (1) ◽  
Author(s):  
Jacobo Torán ◽  
Florian Wörz
Keyword(s):  
Upper Bounds ◽  
Complexity Measure ◽  
Space Complexity ◽  
Concrete Case ◽  
Logarithmic Factor ◽  
Optimal Bound ◽  
Variable Space ◽  
Resolution Refutation ◽  
Pebble Game ◽  
Factor Separation

AbstractWe show a new connection between the clause space measure in tree-like resolution and the reversible pebble game on graphs. Using this connection, we provide several formula classes for which there is a logarithmic factor separation between the clause space complexity measure in tree-like and general resolution. We also provide upper bounds for tree-like resolution clause space in terms of general resolution clause and variable space. In particular, we show that for any formula F, its tree-like resolution clause space is upper bounded by space$$(\pi)$$ ( π ) $$(\log({\rm time}(\pi))$$ ( log ( time ( π ) ) , where $$\pi$$ π is any general resolution refutation of F. This holds considering as space$$(\pi)$$ ( π ) the clause space of the refutation as well as considering its variable space. For the concrete case of Tseitin formulas, we are able to improve this bound to the optimal bound space$$(\pi)\log n$$ ( π ) log n , where n is the number of vertices of the corresponding graph

scholarly journals Generalized Completeness for SOS Resolution and its Application to a New Notion of Relevance

2021 ◽  
pp. 327-343
Author(s):  
Fajar Haifani ◽  
Sophie Tourret ◽  
Christoph Weidenbach
Keyword(s):  
Automated Reasoning ◽  
First Order ◽  
Completeness Result ◽  
Resolution Refutation ◽  
Unsatisfiable Core

AbstractWe prove the SOS strategy for first-order resolution to be refutationally complete on a clause set N and set-of-support S if and only if there exists a clause in S that occurs in a resolution refutation from $$N\cup S$$ N ∪ S . This strictly generalizes and sharpens the original completeness result requiring N to be satisfiable. The generalized SOS completeness result supports automated reasoning on a new notion of relevance aiming at capturing the support of a clause in the refutation of a clause set. A clause C is relevant for refuting a clause set N if C occurs in every refutation of N. The clause C is semi-relevant, if it occurs in some refutation, i.e., if there exists an SOS refutation with set-of-support $$S = \{C\}$$ S = { C } from $$N\setminus \{C\}$$ N \ { C } . A clause that does not occur in any refutation from N is irrelevant, i.e., it is not semi-relevant. Our new notion of relevance separates clauses in a proof that are ultimately needed from clauses that may be replaced by different clauses. In this way it provides insights towards proof explanation in refutations beyond existing notions such as that of an unsatisfiable core.

Sign in / Sign up

Export Citation Format

Share Document