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.)
Handbook of theoretical computer science (vol. B)
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
Multi-agent reasoning with belief contexts: the approach and a case study
ECAI-94 Proceedings of the workshop on agent theories, architectures, and languages on Intelligent agents
Reasoning about knowledge
The resolution calculus
First-order modal logic
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Normal multimodal logics with interaction axioms
Labelled deduction
Constructing the least models for positive modal logic programs
Fundamenta Informaticae
Modal logic
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
An Overview of Temporal and Modal Logic Programming
ICTL '94 Proceedings of the First International Conference on Temporal Logic
An Introduction to Executable Modal and Temporal Logics
IJCAI '93 Proceedings of the Workshop on Executable Modal and Temporal Logics
Translating a Modal Language with Embedded Implication into Horn Clause Logic
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Logic and Databases: A 20 Year Retrospective
LID '96 Proceedings of the International Workshop on Logic in Databases
TIM: The Toulouse Inference Machine for Non-Classical Logic Programming
PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
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
Rational Teams: Logical Aspects of Multi-Agent Systems
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
An SLD-resolution calculus for basic serial multimodal logics
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
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
Declarative programming for artificial intelligence applications
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Foundations of Modal Deductive Databases
Fundamenta Informaticae
Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
Computational Logic in Multi-Agent Systems
Clausal Tableaux for Multimodal Logics of Belief
Fundamenta Informaticae
Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic
International Journal of Approximate Reasoning
A Framework for Graded Beliefs, Goals and Intentions
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
Declarative programming for agent applications
Autonomous Agents and Multi-Agent Systems
Combining and automating classical and non-classical logics in classical higher-order logics
Annals of Mathematics and Artificial Intelligence
Clausal Tableaux for Multimodal Logics of Belief
Fundamenta Informaticae
Foundations of Modal Deductive Databases
Fundamenta Informaticae
Logical foundations for more expressive declarative temporal logic programming languages
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 5.23 |
We give a framework for developing the least model semantics, fixpoint semantics, and SLD-resolution calculi for logic programs in multimodal logics whose frame restrictions consist of the conditions of seriality (i.e. ∀x ∃y Ri (x, y)) and some classical first-order Horn clauses. Our approach is direct and no special restriction on occurrences of □i and ♦i is required. We apply our framework for a large class of basic serial multimodal logics, which are parametefized 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 ϕ. Another part of the work is devoted to programming in multimodal logics intended for reasoning about multidegree belief, for use in distributed systems of belief, or for reasoning about epistemic states of agents in multiagent systems. For that we also use the framework, and although these latter logics belong to the mentioned class of basic serial multimodal logics, the special SLD-resolution calculi proposed for them are more efficient.