M. Aiello, I. Pratt-Hartmann & J. van Benthem (2007):
Handbook of Spatial Logics.
Springer,
doi:10.1007/978-1-4020-5587-4.
A. Artale, R. Kontchakov, V. Ryzhikov & M. Zakharyaschev (2013):
The Complexity of Clausal Fragments of LTL.
In: Proc. of LPAR 2013,
LNCS 8312.
Springer,
pp. 35–52,
doi:10.1007/978-3-642-45221-5_3.
A. Artale, R. Kontchakov, V. Ryzhikov & M. Zakharyaschev (2014):
A Cookbook for Temporal Conceptual Data Modelling with Description Logics.
ACM Transactions on Computational Logic 15(3),
pp. 1–50,
doi:10.1145/2629565.
A. Artale, R. Kontchakov, V. Ryzhikov & M. Zakharyaschev (2015):
Tractable Interval Temporal Propositional and Description Logics.
In: Proc. of AAAI 2015.
AAAI Press,
pp. 1417–1423.
B. Aspvall, M. F. Plass & R. E. Tarjan (1979):
A Linear Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas.
Information Processing Letters 8(3),
pp. 121–123,
doi:10.1016/0020-0190(79)90002-4.
F. Baader, D. Calvanese, D.L. McGuinness, D. Nardi & P.F. Patel-Schneider (2003):
The Description Logic Handbook: Theory, Implementation, and Applications.
Cambridge University Press,
doi:10.2277/0521781760.
P. Blackburn, M. de Rijke & Y. Venema (2002):
Modal Logic.
Cambridge University Press.
R. Bloem, B. Jobstmann, N. Piterman, A. Pnueli & Y. Sa'ar (2012):
Synthesis of Reactive(1) Designs.
Journal of Computer and System Sciences 78(3),
pp. 911–938,
doi:10.1016/j.jcss.2011.08.007.
D. Bresolin, A. Kurucz, E. Muñoz-Velasco, V. Ryzhikov, G. Sciavicco & M. Zakharyaschev (2016):
Horn Fragments of the Halpern-Shoham Interval Temporal Logic (Technical Report).
Available at http://arxiv.org/abs/1604.03515v1.
Preliminary version.
D. Bresolin, E. Muñoz-Velasco & G. Sciavicco (2014):
Sub-propositional Fragments of the Interval Temporal Logic of Allen's Relations.
In: Proc. of JELIA 2014,
LNCS 8761.
Springer,
pp. 122–136,
doi:10.1007/978-3-319-11558-0_9.
C.C. Chen & I.P. Lin (1993):
The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic.
Information Processing Letters 45(3),
pp. 131–136,
doi:10.1016/0020-0190(93)90014-Z.
C.C. Chen & I.P. Lin (1994):
The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics.
Theoretical Computer Science 129(1),
pp. 95–121,
doi:10.1016/0304-3975(94)90082-5.
S. Cook & P. Nguyen (2010):
Logical foundations of proof complexity.
Cambridge University Press,
doi:10.1017/CBO9780511676277.
L. Fariñas Del Cerro & M. Penttonen (1987):
A note on the complexity of the satisfiability of modal Horn clauses.
Journal of Logic Programming 4(1),
pp. 1–10,
doi:10.1016/0743-1066(87)90018-5.
D. Gabbay, I. Hodkinson & M. Reynolds (1994):
Temporal Logic: mathematical foundations and computational aspects, Volume 1.
Oxford Logic Guides.
Oxford University Press.
J.Y. Halpern & Y. Shoham (1991):
A Propositional Modal Logic of Time Intervals.
Journal of the ACM 38,
pp. 279–292,
doi:10.1145/115234.115351.
A. Horn (1951):
On Sentences Which Are True of Direct Unions of Algebras.
Journal of Symbolic Logic 16(1),
pp. 14–21,
doi:10.2307/2268661.
B. Konev, C. Lutz, F. Wolter & M. Zakharyaschev (2015):
Conservative Rewritability of Description Logic TBoxes: First Results.
In: Proc. of the 28th DL Workshop,
CEUR-WS.org 1350,
pp. 196 – 207.
M.R. Krom (1970):
The Decision Problem for Formulas in Prenex Conjunctive Normal Form with Binary Disjunction.
Journal of Symbolic Logic 35(2),
pp. 14–21,
doi:10.2307/2270511.
L.A. Nguyen (2004):
On the complexity of fragments of modal logics.
Advances in Modal Logic 5,
pp. 318–330.