Computational Complexity of Decision Procedures for Polynomials (Extended Abstract)
Leonard M. AdlemanKenneth L. MandersPublished in: FOCS (1975)
Keyphrases
- extended abstract
- decision procedures
- computational complexity
- modal logic
- theorem proving
- automated reasoning
- np complete
- conjunctive queries
- satisfiability problem
- special case
- reasoning problems
- np hard
- quantified boolean formulas
- artificial intelligence
- temporal logic
- integrity constraints
- knowledge representation
- databases
- presburger arithmetic