The Equivalence of the Subsumption Theorem and the Refutation-Completeness for Unconstrained Resolution.
Shan-Hwei Nienhuys-ChengRonald de WolfPublished in: ASIAN (1995)
Keyphrases
- high resolution
- theorem proving
- description logics
- consequence finding
- theorem prover
- inductive inference
- np complete
- low resolution
- conflict detection
- von neumann
- interactive theorem proving
- database
- automated theorem proving
- data quality
- evolutionary algorithm
- expert systems
- video sequences
- multi agent
- multiscale
- information retrieval
- machine learning
- data mining
- real time