Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL

DOI10.1007/978-3-540-69407-6_4zbMath1142.03323OpenAlexW1580836938MaRDI QIDQ3507416

Sergey Babenyshev, Vladimir Vladimirovich Rybakov

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_4

zbMATH Keywords

satisfiabilitylinear temporal logicmulti-agent logicshybrid logicsdecidability algorithmsrelational Kripke-Hintikka models

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (5)

Multiagent temporal logics with multivaluations ⋮ Satisfiability problem in interval FP-logic ⋮ Multi-agent logics with multi-valuations and intensional logical operations ⋮ Multi-agent temporal nontransitive linear logics and the admissibility problem ⋮ Inference Rules in Multi-agents’ Temporal Logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reasoning about common knowledge with infinitely many agents
• A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
• The logic of time. A model-theoretic investigation into the varieties of temporal ontology and temporal discourse.
• Admissibility of logical inference rules
• The hierarchical approach to modeling knowledge and common knowledge
• Logic of transition systems
• Construction of an Explicit Basis for Rules Admissible in Modal System S4
• Constructive interpolation in hybrid logic
• Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals
• Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms
• Rules of inference with parameters for intuitionistic logic
• Towards a Logic of Rational Agency
• On Finite Model Property for Admissible Rules
• An Axiomatization of the Temporal Logic with Until and Since over the Real Numbers
• Hereditarily structurally complete modal logics
• Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
• Logical consecutions in discrete linear temporal logic
• Agent-oriented software engineering II. 2nd international workshop, AOSE 2001, Montreal, Canada, May 29, 2001. Revised papers and invited contributions

This page was built for publication: Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL