Constructing the Least Models for Positive Modal Logic Programs

Authors:
Linh Anh Nguyen
Affiliations:
(Correspd.) Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097 Warsaw, Poland. nguyen@melkor.mimuw.edu.pl
Venue:
Fundamenta Informaticae
Year:
2000

Citing 5
Cited 4

A note on the complexity of the satisfiability of modal Horn clauses

Journal of Logic Programming
The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics

Theoretical Computer Science
The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic

Artificial Intelligence
Gentzen-type systems and resolution rules. Part I. Propositional logic

COLOG '88 Proceedings of the International Conference on Computer Logic
Improved Decision Procedures for the Modal Logics K, T, and S4

CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic

Foundations of Modal Deductive Databases

Fundamenta Informaticae
A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs

Fundamenta Informaticae
The Modal Query Language MDatalog

Fundamenta Informaticae
Logical foundations for more expressive declarative temporal logic programming languages

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L ∈ {KD5,KD45,S5}, or L ∈ {KD,T,KDB,B} and the modal depth of P is finitely bounded, then the least L-model of P can be constructed in PTIME and coded in polynomial space. We also show that if P has no flat models then it has the least models in KB, K5, K45, and KB5. As a consequence, the problem of checking the satisfiability of a set of modal Horn formulae with finitely bounded modal depth in KD, T, KB, KDB, or B is decidable in PTIME. The known result that the problem of checking the satisfiability of a set of Horn formulae in K5, KD5, K45, KD45, KB5, or S5 is decidable in PTIME is also studied in this work via a different method.