The Complexity of Theorem Proving in Circumscription and Minimal Entailment.
Olaf BeyersdorffLeroy ChewPublished in: Electron. Colloquium Comput. Complex. (2014)
Keyphrases
- theorem proving
- theorem prover
- first order logic
- automated deduction
- decision procedures
- automatic programming
- logic programming
- inference rules
- proof planning
- term rewriting
- automated theorem proving
- parallel search
- logical inference
- proof procedure
- combinatorial search
- automated reasoning
- consequence finding
- minimal models
- polynomial hierarchy
- geometry theorem proving
- timed automata
- machine learning
- distributed search
- default reasoning
- answer sets