Pages that link to "Item:Q1258296"
From MaRDI portal
The following pages link to Propositional dynamic logic of regular programs (Q1258296):
Displayed 50 items.
- EXPtime tableaux for ALC (Q1589576) (← links)
- On the completeness of propositional Hoare logic (Q1602554) (← links)
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs (Q1643142) (← links)
- Finite-trace linear temporal logic: coinductive completeness (Q1667649) (← links)
- On the complexity of input/output logic (Q1688711) (← links)
- Deriving the correctness of quantum protocols in the probabilistic logic for quantum programs (Q1701681) (← links)
- Interactions between knowledge, action and commitment within agent dynamic logic (Q1770620) (← links)
- About cut elimination for logics of common knowledge (Q1772772) (← links)
- Towards reasoning about Petri nets: a propositional dynamic logic based approach (Q1786561) (← links)
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus (Q1801498) (← links)
- The price of universality (Q1815426) (← links)
- Domino-tiling games (Q1822501) (← links)
- Deterministic propositional dynamic logic: finite models, complexity, and completeness (Q1839245) (← links)
- Combining deduction and model checking into tableaux and algorithms for converse-PDL. (Q1854371) (← links)
- Module checking (Q1854407) (← links)
- Tarskian set constraints (Q1854523) (← links)
- On the structural simplicity of machines and languages (Q1924785) (← links)
- The complexity of identifying characteristic formulae (Q1987735) (← links)
- Almost event-rate independent monitoring (Q2008287) (← links)
- Producing explanations for rich logics (Q2024339) (← links)
- The compound interest in relaxing punctuality (Q2024340) (← links)
- Computational complexity for bounded distributive lattices with negation (Q2032990) (← links)
- Dynamic preference logic meets iterated belief change: representation results and postulates characterization (Q2034761) (← links)
- Inquisitive propositional dynamic logic (Q2035846) (← links)
- Event-based time-stamped claim logic (Q2043818) (← links)
- Temporal logic with recursion (Q2051830) (← links)
- NP reasoning in the monotone \(\mu\)-calculus (Q2096471) (← links)
- A semantics and a logic for \textit{Fuzzy Arden Syntax} (Q2099984) (← links)
- Dynamic Łukasiewicz logic and its application to immune system (Q2100245) (← links)
- The satisfiability problem for a quantitative fragment of PCTL (Q2140493) (← links)
- Adding proof calculi to epistemic logics with structured knowledge (Q2145260) (← links)
- Compositional verification of concurrent systems by combining bisimulations (Q2147689) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- Propositional dynamic logic with quantification over regular computation sequences (Q2151417) (← links)
- A modal view on resource-bounded propositional logics (Q2157601) (← links)
- A formalism to specify unambiguous instructions inspired by Mīmāṁsā in computational settings (Q2169123) (← links)
- Cartesian difference categories (Q2200813) (← links)
- Dynamic Łukasiewicz logic and dynamic MV-algebras (Q2206432) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- Free Kleene algebras with domain (Q2210872) (← links)
- Program schemata technique for propositional program logics: a 30-year history (Q2216719) (← links)
- Temporal logics with language parameters (Q2232279) (← links)
- Strategies, model checking and branching-time properties in Maude (Q2239275) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Decision procedures and expressiveness in the temporal logic of branching time (Q2265816) (← links)
- Two AGM-style characterizations of model repair (Q2294584) (← links)
- ExpTime tableaux with global caching for hybrid PDL (Q2303231) (← links)
- Deontology of compound actions (Q2304622) (← links)
- Complexity of the universal theory of modal algebras (Q2307300) (← links)
- The model checking fingerprints of CTL operators (Q2317834) (← links)