Subsumption Demodulation in First-Order Theorem Proving.
Bernhard GleissLaura KovácsJakob RathPublished in: IJCAR (1) (2020)
Keyphrases
- desirable properties
- theorem proving
- first order logic
- term rewriting
- transitive closure
- theorem prover
- predicate calculus
- inference rules
- automated deduction
- decision procedures
- automated reasoning
- propositional logic
- description logics
- proof procedure
- automatic programming
- horn clauses
- automated theorem proving
- probabilistic reasoning
- parallel search
- distributed search
- knowledge representation
- np complete
- combinatorial search
- proof planning
- model theoretic
- logical inference
- quantifier elimination
- consequence finding
- geometry theorem proving
- proof search
- inductive logic programming
- natural deduction
- constraint databases
- probabilistic logic