An Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics

DOI10.1007/978-3-642-45221-5_1zbMath1433.03019OpenAlexW136981523MaRDI QIDQ2870111

Angelo Montanari, Guido Sciavicco, Dario Della Monica, Anna Ingólfsdóttir, Luca Aceto

Publication date: 17 January 2014

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45221-5_1

zbMATH Keywords

satisfiabilityentailmentenumeration problemsmodal logicsHorn theory

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases ⋮ On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders

This page was built for publication: An Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics