Integrating a spatial reasoner with a resolution theorem-prover

Authors:
Thomas R. Ioerger
Affiliations:
Department of Computer Science, Texas A&M University, College Station, TX
Venue:
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Year:
1997

Citing 6
Cited 1

Automated deduction by theory resolution

Journal of Automated Reasoning
Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Many-sorted unification

Journal of the ACM (JACM)
A resolution principle for constrained logics

Artificial Intelligence
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
An essential hybrid reasoning system: knowledge and symbol level accounts of KRYPTON

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

Route generation and description using a logical and an analogical framework

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some spatial reasoning systems use images to solve problems, rather than making formal logical inferences. However, an open question is how to use these systems in contexts where some nonspatial information is also involved. We present a hybrid reasoning method in which we extend the capabilities of a spatial reasoner by integrating it with a resolution theorem-prover. We prove that the hybrid system is refutation-complete, in the sense that, if a domain theory is unsatisfiable, perhaps only because all of its models entail unrealizable images, then our algorithm will halt. We discuss how our approach differs from other hybrid reasoning algorithms in the way it manages the interaction between sub-systems.