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

Authors:
Luis Farin:9Alas del Cerro;Martti Penttonen
Affiliations:
Univ. Paul Sabatier, Toulouse, France;Univ. of Turku, Turku, Finland
Venue:
Journal of Logic Programming
Year:
1987

Citing 0
Cited 7

On temporal logic versus datalog

Theoretical Computer Science - Logic and complexity in computer science
A fixpoint semantics and an SLD-resolution calculus for modal logic programs

Fundamenta Informaticae
The Modal Query Language MDatalog

Fundamenta Informaticae
The data complexity of MDatalog in basic modal logics

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs

Fundamenta Informaticae
The Modal Query Language MDatalog

Fundamenta Informaticae
Constructing the Least Models for Positive Modal Logic Programs

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract