scientific article; zbMATH DE number 6917935

DOI10.23638/LMCS-14(2:16)2018MaRDI QIDQ4580320zbMATH OpenFDO

Authors Davide Bresolin, Emilio Muñoz-Velasco, Guido Sciavicco

Publication date 15 August 2018

Full work available at URL https://arxiv.org/abs/1611.08800

zbMATH Keywords

modal logicHorn and sub-Horn fragmentsKrom and sub-Krom fragments

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Recommendations

• scientific article; zbMATH DE number 7439733
• On the complexity of fragments of modal logics
• scientific article; zbMATH DE number 823607
• A substructural approach to explicit modal logic
• On non-self-referential fragments of modal logics
• The monodic fragment of propositional term modal logic
• Modal languages and bounded fragments of predicate logic
• scientific article; zbMATH DE number 1841824
• Kripke semantics for modal substructural logics
• scientific article; zbMATH DE number 7204444

Cites work

• scientific article; zbMATH DE number 747023 (Why is no real title available?)
• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• scientific article; zbMATH DE number 2053218 (Why is no real title available?)
• scientific article; zbMATH DE number 1501629 (Why is no real title available?)
• A Cookbook for Temporal Conceptual Data Modelling with Description Logics
• A Tractable Rule Language in the Modal and Description Logic that Combines CPDL with Regular Grammar Logic
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• A note on the complexity of the satisfiability of modal Horn clauses
• Handbook of Spatial Logics
• Horn fragments of the Halpern-Shoham interval temporal logic
• Multimodal logic programming using equational and order-sorted logic
• On sentences which are true of direct unions of algebras
• Sub-propositional fragments of the interval temporal logic of Allen's relations
• Synthesis of Reactive(1) designs
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• The complexity of clausal fragments of LTL
• The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics

Cited in

(9)

• Adding clauses to poor man's logic (without increasing the complexity)
• Modal logics with hard diamond-free fragments
• An algebraic approach to subframe logics. Modal case
• scientific article; zbMATH DE number 2196592 (Why is no real title available?)
• scientific article; zbMATH DE number 7439733 (Why is no real title available?)
• Modal languages and bounded fragments of predicate logic
• On the complexity of fragments of modal logics
• On non-self-referential fragments of modal logics
• Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580320)