Pages that link to "Item:Q1258296"
From MaRDI portal
The following pages link to Propositional dynamic logic of regular programs (Q1258296):
Displayed 50 items.
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs (Q1311976) (← links)
- A modal perspective on the computational complexity of attribute value grammar (Q1314274) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- Complexity results for two-way and multi-pebble automata and their logics (Q1349896) (← links)
- The complexity of PDL with interleaving (Q1351943) (← links)
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Q1377625) (← links)
- Modeling belief in dynamic systems. I: Foundations (Q1389534) (← links)
- Program schemata vs. automata for decidability of program logics (Q1392141) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- Complexity of some problems in positive and related calculi (Q1401362) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Symbolic model checking for \(\mu\)-calculus requires exponential time (Q1575656) (← links)
- EXPtime tableaux for ALC (Q1589576) (← links)
- On the completeness of propositional Hoare logic (Q1602554) (← links)
- Interactions between knowledge, action and commitment within agent dynamic logic (Q1770620) (← links)
- About cut elimination for logics of common knowledge (Q1772772) (← 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)
- Decision procedures and expressiveness in the temporal logic of branching time (Q2265816) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- Symbolic model checking for channel-based component connectors (Q2389338) (← links)
- Path constraints in semistructured data (Q2456353) (← links)
- Reasoning on UML class diagrams (Q2457652) (← links)
- A tableau decision procedure for \(\mathcal{SHOIQ}\) (Q2462647) (← links)
- A sequent calculus for logic of knowledge and past time: completeness and decidability (Q2471643) (← links)
- The complexity of finite model reasoning in description logics (Q2486582) (← links)
- Model checking propositional dynamic logic with all extras (Q2494725) (← links)
- On complexity of verification of interacting agents' behavior (Q2498917) (← links)
- Characterizing EF and EX tree logics (Q2503041) (← links)
- Complexity of modal logics with Presburger constraints (Q2638188) (← links)
- A propositional logic of Boolean recursive programs in which predicate variables appear in conditions (Q2639846) (← links)
- Mechanizing common knowledge logic using COQ (Q2643149) (← links)
- Propositional dynamic logic with recursive programs (Q2643333) (← links)
- Complexity analysis of propositional concurrent programs using domino tiling (Q3142002) (← links)
- REASONING ABOUT TRANSFINITE SEQUENCES (Q3426789) (← links)
- Computation Tree Regular Logic for Genetic Regulatory Networks (Q3540063) (← links)
- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions (Q3584967) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Game Quantification Patterns (Q3601804) (← links)
- PDL with intersection and converse: satisfiability and infinite-state model checking (Q3616354) (← links)
- Description Logics (Q3638996) (← links)
- Logical Foundations of XML and XQuery (Q3638998) (← links)
- PDL with intersection of programs: a complete axiomatization (Q3643256) (← links)