The Complexity of Theorem Proving in Circumscription and Minimal Entailment.
Olaf BeyersdorffLeroy ChewPublished in: IJCAR (2014)
Keyphrases
- theorem proving
- theorem prover
- automated reasoning
- first order logic
- decision procedures
- automated deduction
- inference rules
- automated theorem proving
- parallel search
- proof planning
- logic programming
- term rewriting
- proof procedure
- automatic programming
- logical inference
- predicate calculus
- geometry theorem proving
- minimal models
- polynomial hierarchy
- combinatorial search
- logic programs
- consequence finding
- equational theories
- answer sets
- np complete
- timed automata
- knowledge representation
- probability distribution
- expert systems