T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pages 216--226, 1978. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Boolean Formulas are Hard to Learn for Most - Gate Bases Ictor (Correct)
.... Constraint Satisfaction Problems [13, 14, 15, 16, 12] Finally we mention some similar results: a dichotomy result for satisfiability, tautology and some counting problems over closed sets of boolean functions [23] the circuit value problem [11, 10] the satisfiability of generalized formulas [24], the inverse generalized satisfiability problem [17] the generalized satisfiability counting problem [7] the approximability of minimization and maximization problems [6, 19, 20] the optimal assignments of Generalized Propositional Formulas [22] and the learnability of quantified boolean ....
T.J. Schaefer. The Complexity of Satisfiability Problems. In 10th Annual ACM Symposium on Theory of Computing, pages 216--226, 1978. 16
Inverse NP Problems - Chen (Correct)
....and Sideri [7] considered the inverse satisfiability problem, which includes as a specific case the inverse 3 sat problem. It is from them that we adopt the term inverse problem. They examined the class of generalized boolean satisfiability problems on which Schaefer s dichotomy theorem [12] was proved a class which includes Horn SAT and 2 SAT, two well known tractable subclasses of SAT; as well as not all equal SAT and one in three SAT, two intractable variants of SAT. For any satisfiability problem from this generalized class, the inverse problem is always in coNP by an argument ....
T. J. Schaefer. The complexity of satisfiability problems. In Proc. 10th Annual ACM Symposium on Theory of Computing, pages 216--226, 1978.
The Complexity of Problems Defined by Subclasses of Boolean.. - Reith, Wagner (1999) (2 citations) (Correct)
....B by superposition is easy to solve, if B is a subset of one of four specified closed sets of boolean functions. Otherwise it is NP complete. There exists an algorithm which decides which of the cases takes place. Similar results are proved for the other problems. Related work has been done in [Sch78, CH96, CH97, Cre95, RV98, KST97] where only boolean formulae in conjunctive normal form were considered. 1 Introduction In the twenties of this century E. L. POST proved very remarkable results on the structure of boolean functions (which were published only in 1942, see [Pos41] For a set B of boolean functions let [B] be ....
....is complete for NP . ffl If [B] R 0 or [B] M or [B] D or [B] L then TAUT(B) is in P . Otherwise TAUT(B) is complete for co NP . For each of these statements there exists an algorithm which decides which of the cases takes place. Finally let us mention the related work done previously in [Sch78, CH96, CH97, Cre95, RV98, KST97]. There the restricted case of formulae in conjunctive normal form is studied. All the restrictions made there concern only the boolean functions which build the clauses of the conjunctive normal forms. The paper is organized as follows: In Section 2 we present POST s results on closed classes of ....
T. J. SCHAEFER. The complexity of satisfiability problems. In Proccedings 10th STOC, San Diego (CA, USA), pages 216--226. Association for Computing Machinery, 1978.
Data Exchange: Semantics and Query Answering - Fagin, Kolaitis, Miller, Popa (2002) (31 citations) (Correct)
.... #x # y # z#, is there a truth assignment to the variables of such that for every clause of at least one variable is assigned value true and at least one variable is assigned value false This problem is known to 28 be NP complete (for instance, this can be derived easily from Schaefer s [Sch78] results on the complexity of GENERALIZED SATISFIABILITY problems) Before embarking on the description of the reduction, we give some intuition for one of the key constructs in the reduction. Suppose that a database schema contains a binary relation symbol L and consider an instance in which ....
T.J. Schaefer. The Complexity of Satisfiability Problems. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 216--226, 1978.
Data Exchange: Semantics and Query Answering - Fagin, Kolaitis, Miller, Popa (2002) (31 citations) (Correct)
.... clauses , is there a truth assignment to the variables of such that for every clause of at least one variable is assigned value true and at least one variable is assigned value false This problem is known to 28 be NP complete (for instance, this can be derived easily from Schaefer s [Sch78] results on the complexity of GENERALIZED SATISFIABILITY problems) Before embarking on the description of the reduction, we give some intuition for one of the key constructs in the reduction. Suppose that a database schema contains a binary relation symbol and consider an instance in which ....
T.J. Schaefer. The Complexity of Satisfiability Problems. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 216--226, 1978.
Maximum Exact Satisfiability: NP-completeness Proofs and.. - Madsen, Rossmanith (2004) (Correct)
No context found.
T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pages 216--226, 1978.
An Algorithm for Exact Satisfiability Analysed with the Number of .. - Madsen (2004) (Correct)
No context found.
T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pages 216-- 226, 1978.
Vertex-Partitioning into Fixed Additive Induced-Hereditary.. - Farrugia (2004) (Correct)
No context found.
T.J. Schaefer, The complexity of satisfiability problems, Proc. 10th Ann. ACM Symp. on Theory of Computing, Association for Computing Machinery, New York (1978) 216--226.
Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms - Chen (Correct)
No context found.
T. Schaefer. The complexity of satisfiability problems. Proceedings of the 10th Annual Symposium on Theory of Computing, ACM, 1978.
Optimization, Games, and Quantified Constraint Satisfaction - Chen, Pal (Correct)
No context found.
Thomas J. Schaefer. The complexity of satisfiability problems. Proceedings of the Tenth ACM Symposium on Theory of Computing, pp. 216--226, 1978.
(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP.. - Chen, Dalmau (Correct)
No context found.
T. Schaefer. The complexity of satisfiability problems. Proceedings of the 10th Annual Symposium on Theory of Computing, ACM, 1978.
Efficient Algorithms for the Consistency Analysis in Szenario - Projects Rainer Feldmann (Correct)
No context found.
T.J. Schaefer. The complexity of satisfiability problems. In Proc. 10th Ann. ACM Symp. on Theory of Computing, pp 216--226. Association for Computing Machinery, 1978.
Postman Problems on Mixed Graphs - Mart (2003) (Correct)
No context found.
T. J. Schaefer. The complexity of satisfiability problems. In Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978.
Parameterized Complexity of Constraint Satisfaction Problems - Marx (2004) (Correct)
No context found.
T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the tenth annual ACM symposium on Theory of computing, pages 216--226. 1978. 11
The Approximability of Constraint Satisfaction Problems - Khanna, Sudan, Trevisan.. (2001) (6 citations) (Correct)
No context found.
T. Schaefer, The complexity of satisfiability problems, in Proceedings of the 10th Annual ACM Symposium on Theory of Computing, San Diego, 1978, pp. 216--226.
Conjunctive Queries over Trees - Gottlob, Koch, Schulz (2004) (3 citations) (Correct)
No context found.
T. Schaefer. "The Complexity of Satisfiability Problems". In Proc. 10th Ann. ACM Symp. on Theory of Computing (STOC), pages 216--226, 1978.
Uniqueness and Complexity in Generalised Colouring - Farrugia (2003) (Correct)
No context found.
T.J. Schaefer, The complexity of satisfiability problems, Proc. 10th Ann. ACM Symp. on Theory of Computing, Association for Computing Machinery, New York (1978) 216--226. Cit. p. 96.
Search vs. Symbolic Techniques in Satisfiability Solving - Pan, Vardi (Correct)
No context found.
T. Schaefer. The complexity of satisfiability problems. In STOC'78, pages 216--226, 1978.
Looking Algebraically at Tractable Quantified Boolean Formulas - Chen, Dalmau (Correct)
No context found.
T. Schaefer. The complexity of satisfiability problems. Proceedings of the 10th Annual Symposium on Theory of Computing, ACM, 1978.
Periodic Constraint Satisfaction Problems: Polynomial-Time.. - Chen (Correct)
No context found.
Thomas J. Schaefer. The complexity of satisfiability problems. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 216--226, 1978.
Constraint Satisfaction - Complexity And Logic (Correct)
No context found.
T.J. Schaefer. The complexity of satisfiability problems. In Proc. 10th ACM Symp. on Theory of Computing, pages 216-226, 1978.
The Complexity of Counting Self-Avoiding Walks in.. - Liskiewicz, Ogihara.. (2001) (Correct)
No context found.
T. Schaefer. The complexity of satisfiability problem. In Proceedings of 10th Symposium on Theory of Computing, pages 216--226. ACM Press, 1978.
Inverse Circumscription - Chen (Correct)
No context found.
Thomas J. Schaefer. The complexity of satisfiability problems. In Proc. 10th Annual ACM Symposium on Theory of Computing, pages 216--226, 1978.
Closure Functions and Width 1 Problems - Dalmau, Pearson (1999) (2 citations) (Correct)
No context found.
T.J. Schaefer. The Complexity of Satisfiability Problems. In 10th Annual ACM Symposium on Theory of Computing, pages 216--226, 1978.
Constraint Satisfaction - Complexity And Logic (Correct)
No context found.
T.J. Schaefer. The complexity of satisfiability problems. In Proc. 10th ACM Symp. on Theory of Computing, pages 216--226, 1978.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC