Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On the complexity of the theories of weak direct products (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Complexity of solvable cases of the decision problem for the predicate calculus
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Fast algorithms for testing unsatisfiability of ground horn clauses with equations
Journal of Symbolic Computation
Complexity of Linear Standard Theories
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Simultaneous Rigid E-Unification and Related Algorithmic Problems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
Quantified Equality Constraints
SIAM Journal on Computing
Collapsibility in infinite-domain quantified constraint satisfaction
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The decision problem for positive first-order logic with equality is NP-complete. More generally, if Σ is a finite set of atomic sentences (i.e., atomic formulas of the form t1 = t2, or Rt1... tn containing no variables) and negations of atomic sentences and if φ is a positive first-order sentence, then the problem of determining whether φ is true in all models of Σ is NP-complete.