Executing temporal logic programs
Executing temporal logic programs
MOLOG: A system that extends PROLOG with modal logic
New Generation Computing
A note on the complexity of the satisfiability of modal Horn clauses
Journal of Logic Programming
Temporal logic programming language Tokio–programming in Tokio
Proceedings of the 4th conference on Logic programming '85
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Temporal logics and their applications
Journal of Symbolic Computation
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
A temporal extension of PROLOG
Journal of Logic Programming
Theoretical Computer Science
The resolution calculus
An Overview of Temporal and Modal Logic Programming
ICTL '94 Proceedings of the First International Conference on Temporal Logic
From the Past to the Future: Executing Temporal Logic Programs
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Gentzen-type systems and resolution rules. Part I. Propositional logic
COLOG '88 Proceedings of the International Conference on Computer Logic
An Introduction to Executable Modal and Temporal Logics
IJCAI '93 Proceedings of the Workshop on Executable Modal and Temporal Logics
Temporal Logic Programming with Metric and Past Operators
IJCAI '93 Proceedings of the Workshop on Executable Modal and Temporal Logics
Improved Decision Procedures for the Modal Logics K, T, and S4
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
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
METATEM: A Framework for Programming in Temporal Logic
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
A Resolution Calculus for Modal Logics
Proceedings of the 9th International Conference on Automated Deduction
The Modal Query Language MDatalog
Fundamenta Informaticae
Constructing the Least Models for Positive Modal Logic Programs
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 | 0.00 |
We propose a modal logic programming language called MProlog, which is as expressive as the general modal Horn fragment. We give a fixpoint semantics and an SLD-resolution calculus for MProlog in all of the basic serial modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. For an MProlog program P and for L being one of the mentioned logics, we define an operator T_{L,P}, which has the least fixpoint I_{L,P}. This fixpoint is a set of formulae, which may contain labeled forms of the modal operator ⋄, and is called the least L-model generator of P. The standard model of I_{L,P} is shown to be a least L-model of P. The SLD-resolution calculus for MProlog is designed with a similar style as for classical logic programming. It is sound and complete. We also extend the calculus for MProlog in the almost serial modal logics KB, K5, K45, and KB5.