AbstractWe consider a specific class of satisfiability (SAT) problems, the conjunctions of (nested) equivalencies (CoE). It is well known that CNF (conjunctive normal form) translations of CoE formulas are hard for branching and resolution algorithms. Tseitin proved that regular resolution requires a running time exponential in the size of the input. We review a polynomial time algorithm for solving CoE formulas, and address the problem of recognizing a CoE formula by its CNF representation. Making use of elliptic approximations of 3SAT problems, the so-called doubly balanced 3SAT formulas can be seen to be equivalent to CoE formulas. Subsequently, the notion of doubly balancedness is generalized by using polynomial representations of satis...
AbstractIn this paper the class of mixed Horn formulas is introduced that contain a Horn part and a ...
The satisfiability problem is known to be NP-complete in general and for many restricted instances, ...
AbstractRecognition of minimal unsatisfiable CNF formulas (unsatisfiable CNF formulas which become s...
AbstractWe consider a specific class of satisfiability (SAT) problems, the conjunctions of (nested) ...
In this paper, we introduce general techniques for extending classes of polynomially solvable SAT in...
Finding subclasses of formulae for which the SAT problem can be solved in polynomial time has been a...
One of the main results in Theory of Computation courses is the proof that propositional satisfiabil...
This document describes an algorithm that is supposed to decide in polynomial time and space if an e...
AbstractThe Exact Satisfiability problem is to determine if a CNF-formula has a truth assignment sat...
Knuth (1990) introduced the class of nested formulas and showed that their satisfiability can be dec...
In the first part of this work (FSTTCS’10) we have shown that the satisfiability of CNF formulas wit...
In the first part of this work (FSTTCS’10) we have shown that the satisfiability of CNF formulas wit...
In this paper we propose a structural parameter of CNF formulas and use it to identify instances of ...
AbstractThe scope of certain well-studied polynomial-time solvable classes of Satisfiability is inve...
This paper presents a proof of the conjecture that the complexity classes P and NP are not equal. Th...
AbstractIn this paper the class of mixed Horn formulas is introduced that contain a Horn part and a ...
The satisfiability problem is known to be NP-complete in general and for many restricted instances, ...
AbstractRecognition of minimal unsatisfiable CNF formulas (unsatisfiable CNF formulas which become s...
AbstractWe consider a specific class of satisfiability (SAT) problems, the conjunctions of (nested) ...
In this paper, we introduce general techniques for extending classes of polynomially solvable SAT in...
Finding subclasses of formulae for which the SAT problem can be solved in polynomial time has been a...
One of the main results in Theory of Computation courses is the proof that propositional satisfiabil...
This document describes an algorithm that is supposed to decide in polynomial time and space if an e...
AbstractThe Exact Satisfiability problem is to determine if a CNF-formula has a truth assignment sat...
Knuth (1990) introduced the class of nested formulas and showed that their satisfiability can be dec...
In the first part of this work (FSTTCS’10) we have shown that the satisfiability of CNF formulas wit...
In the first part of this work (FSTTCS’10) we have shown that the satisfiability of CNF formulas wit...
In this paper we propose a structural parameter of CNF formulas and use it to identify instances of ...
AbstractThe scope of certain well-studied polynomial-time solvable classes of Satisfiability is inve...
This paper presents a proof of the conjecture that the complexity classes P and NP are not equal. Th...
AbstractIn this paper the class of mixed Horn formulas is introduced that contain a Horn part and a ...
The satisfiability problem is known to be NP-complete in general and for many restricted instances, ...
AbstractRecognition of minimal unsatisfiable CNF formulas (unsatisfiable CNF formulas which become s...