Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.

DOI10.1007/3-540-45653-8_1zbMath1275.03088OpenAlexW1606555018MaRDI QIDQ2996150

Frank Wolter, I. M. Hodkinson, Michael Zakharyashchev

Publication date: 6 May 2011

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

Full work available at URL: https://doi.org/10.1007/3-540-45653-8_1

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (12)

A decidable and expressive fragment of Many-Sorted first-order linear temporal logic ⋮ Sound verification procedures for temporal properties of infinite-state systems ⋮ Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ Complexity of finite-variable fragments of propositional temporal and modal logics of computation ⋮ A survey on temporal logics for specifying and verifying real-time systems ⋮ Are bundles good deals for first-order modal logic? ⋮ Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting ⋮ Second-order propositional modal logic: expressiveness and completeness results ⋮ The monodic fragment of propositional term modal logic ⋮ Checking content consistency of integrated web documents ⋮ Propositional epistemic logics with quantification over agents of knowledge (an alternative approach) ⋮ Complexity of monodic guarded fragments over linear and real time

This page was built for publication: Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.