A resolution method for quantified modal logics of knowledge and belief

Authors:
Christophe Geissler;Kurt Konolige
Affiliations:
École Nationale Superieure, des Telecommunications, Paris, France;Stanford University
Venue:
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
Year:
1986

Citing 5
Cited 0

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Planning English Sentences

Planning English Sentences
Knowledge and common knowledge in a distributed environment

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Nonclausal temporal deduction

Nonclausal temporal deduction
A deduction model of belief and its logics

A deduction model of belief and its logics

Quantified Score

Hi-index	0.00

Visualization

Abstract

B-resolution is a sound and complete resolution rule for quantified modal logics of knowledge and belief with a standard Kripke semantics. It differs from ordinary first-order binary resolution in that it can have an arbitrary (but finite) number of inputs, is not necessarily effective, and does not have a most general unifier covering every instance of an application. These properties present obvious obstacles to implementation in an automatic theorem-proving system. By using a technique similar to semantic attachment, we obtain a very natural expression of B-resolution that is potentially efficient, and easily understood and controlled. We have implemented the method and used it to solve the Wise Man Puzzle.