Pages that link to "Item:Q1119565"
From MaRDI portal
The following pages link to The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565):
Displaying 43 items.
- Book review of: Johan van Benthem, Logical dynamics of information and interaction (Q456975) (← links)
- Exploring the tractability border in epistemic tasks (Q484931) (← links)
- Infinite games with finite knowledge gaps (Q528188) (← links)
- Merging DEL and ETL (Q616038) (← links)
- Preface to the special issue: Temporal logics of agency (Q616042) (← links)
- \({\mathcal E}\)-connections of abstract description systems (Q814594) (← links)
- First-order temporal verification in practice (Q851137) (← links)
- Decidability of logics based on an indeterministic metric tense logic (Q897475) (← links)
- Knowledge condition games (Q1006447) (← links)
- Merging frameworks for interaction (Q1037376) (← links)
- A guide to completeness and complexity for modal logics of knowledge and belief (Q1193476) (← links)
- Modelling knowledge and action in distributed systems (Q1262142) (← links)
- Common knowledge and update in finite environments (Q1383157) (← links)
- Modeling belief in dynamic systems. I: Foundations (Q1389534) (← links)
- Clausal resolution in a logic of rational agency (Q1606116) (← links)
- Hierarchical information and the synthesis of distributed strategies (Q1629748) (← links)
- Computation as social agency: what, how and who (Q1641025) (← links)
- Interactions between knowledge, action and commitment within agent dynamic logic (Q1770620) (← links)
- The price of universality (Q1815426) (← links)
- Modal logic, truth, and the master modality. (Q1857362) (← links)
- Modeling reasoning in a social setting (Q2016076) (← links)
- Model-based safety assessment of a triple modular generator with xSAP (Q2026377) (← links)
- Discrete linear temporal logic with knowing-value operator (Q2148826) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- Diagnosability of fair transition systems (Q2152493) (← links)
- A history based logic for dynamic preference updates (Q2209166) (← links)
- Intensional protocols for dynamic epistemic logic (Q2295601) (← links)
- Toward a theory of play: a logical perspective on games and interaction (Q2344965) (← links)
- Uniform strategies, rational relations and jumping automata (Q2346407) (← links)
- Knowledge and communication: A first-order theory (Q2457657) (← links)
- Some comments on history based structures (Q2475431) (← links)
- Using temporal logics of knowledge for specification and verification -- a case study (Q2494726) (← links)
- The logic of knowledge based obligation (Q2500829) (← links)
- Non-primitive recursive decidability of products of modal logics with expanding domains (Q2503403) (← links)
- Temporal Logics of Knowledge and their Applications in Security (Q2866724) (← links)
- Logics of Rational Interaction (Q2902939) (← links)
- Building an Epistemic Logic for Argumentation (Q2915085) (← links)
- Synchronizing Automata with Extremal Properties (Q2946348) (← links)
- The Logic of Public Announcements, Common Knowledge, and Private Suspicions (Q2971701) (← links)
- Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall (Q3393383) (← links)
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries (Q5870513) (← links)
- Assumption-based runtime verification (Q6102167) (← links)
- IS CAUSAL REASONING HARDER THAN PROBABILISTIC REASONING? (Q6131225) (← links)
