Can a Higher-Order and a First-Order Theorem Prover Cooperate?.
Christoph BenzmüllerVolker SorgeMateja JamnikManfred KerberPublished in: LPAR (2004)
Keyphrases
- theorem prover
- higher order
- first order logic
- term rewriting
- theorem proving
- higher order logic
- automated reasoning
- inference rules
- cooperative
- automated theorem proving
- computer algebra
- high order
- propositional logic
- markov random field
- formal semantics
- timed automata
- formal proof
- pairwise
- predicate calculus
- proof planning
- natural deduction
- inductive logic programming
- knowledge representation
- mathematical knowledge