Pages that link to "Item:Q1134756"
From MaRDI portal
The following pages link to A near-optimal method for reasoning about action (Q1134756):
Displaying 44 items.
- ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching (Q352943) (← links)
- Dynamic extensions of arrow logic (Q598299) (← links)
- ExpTime tableau decision procedures for regular grammar logics with converse (Q763333) (← links)
- The temporal logic of branching time (Q789895) (← links)
- Propositional dynamic logic of nonregular programs (Q792083) (← links)
- The propositional dynamic logic of deterministic, well-structured programs (Q801682) (← links)
- Results on the propositional \(\mu\)-calculus (Q801893) (← links)
- Automata-theoretic techniques for modal logics of programs (Q1090675) (← links)
- Process logic: Expressiveness, decidability, completeness (Q1168965) (← links)
- On the computational complexity of satisfiability in propositional logics of programs (Q1170028) (← links)
- Dynamic algebras: Examples, constructions, applications (Q1189900) (← links)
- The complexity of PDL with interleaving (Q1351943) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- On the complexity of input/output logic (Q1688711) (← 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)
- Free Kleene algebras with domain (Q2210872) (← links)
- ExpTime tableaux with global caching for hybrid PDL (Q2303231) (← links)
- The model checking fingerprints of CTL operators (Q2317834) (← links)
- A modal logic of epistemic games (Q2344955) (← links)
- A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
- Clausal Tableaux for Hybrid PDL (Q2825411) (← links)
- Converse-PDL with regular inclusion axioms: a framework for MAS logics (Q2901207) (← links)
- Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics (Q3010369) (← links)
- Complexity analysis of propositional concurrent programs using domino tiling (Q3142002) (← links)
- Tableaux Methods for Propositional Dynamic Logics with Separating Parallel Composition (Q3454121) (← links)
- Logical approaches to deontic reasoning: From basic questions to dynamic solutions (Q3537541) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm (Q3605534) (← links)
- PDL with intersection and converse: satisfiability and infinite-state model checking (Q3616354) (← links)
- BDD-based decision procedures for the modal logic K ★ (Q3647260) (← links)
- On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)
- Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic (Q4639929) (← links)
- Tableaux and algorithms for Propositional Dynamic Logic with Converse (Q4647551) (← links)
- An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability (Q4982121) (← links)
- (Q5015273) (← links)
- A Tableau Calculus for Regular Grammar Logics with Converse (Q5191117) (← links)
- An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability (Q5191118) (← links)
- Optimal Tableau Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-Time Temporal Logic ATL <sup>+</sup> (Q5277905) (← links)
- A resolution calculus for the branching-time temporal logic CTL (Q5410337) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Terminating Tableaux for Hybrid Logic with Eventualities (Q5747764) (← links)
