An SLD-resolution calculus for basic serial multimodal logics

Authors:
Linh Anh Nguyen
Affiliations:
Institute of Informatics, University of Warsaw, Warsaw, Poland
Venue:
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Year:
2005

Citing 8
Cited 2

MOLOG: A system that extends PROLOG with modal logic

New Generation Computing
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Multimodal logic programming using equational and order-sorted logic

Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
First-order modal logic

First-order modal logic
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
A Resolution Calculus for Modal Logics

Proceedings of the 9th International Conference on Automated Deduction
How to Use Modalities and Sorts in Prolog

JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
A fixpoint semantics and an SLD-resolution calculus for modal logic programs

Fundamenta Informaticae

Multimodal logic programming

Theoretical Computer Science
Reasoning about epistemic states of agents by modal logic programming

CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop semantics for modal logic programs in basic serial multimodal logics, which are parameterized by an arbitrary combination of generalized versions of axioms T, B, 4, 5 (in the form, e.g., 4:□iϕ→□j□kϕ) and I:□iϕ→□jϕ. We do not assume any special restriction for the form of programs and goals. Our fixpoint semantics and SLD-resolution calculus are defined using the direct approach and closely reflect the axioms of the used modal logic. We prove that our SLD-resolution calculus is sound and complete.