Pages that link to "Item:Q1854371"

The following pages link to Combining deduction and model checking into tableaux and algorithms for converse-PDL. (Q1854371):

Displaying 17 items.

• Extending propositional dynamic logic for Petri nets (Q281154) (← links)
• A calculus for automatic verification of Petri nets based on resolution and dynamic logics (Q530854) (← links)
• ExpTime tableau decision procedures for regular grammar logics with converse (Q763333) (← links)
• Data complexity of query answering in expressive description logics via tableaux (Q945056) (← links)
• Eliminating ``converse'' from converse PDL (Q1923830) (← links)
• A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
• Clausal tableaux for hybrid PDL (Q2825411) (← links)
• Testing XML constraint satisfiability (Q2867947) (← 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)
• Tableaux Methods for Propositional Dynamic Logics with Separating Parallel Composition (Q3454121) (← links)
• Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs (Q3602955) (← links)
• Tableaux for a combination of propositional dynamic logic and epistemic logic with interactions* (Q4612412) (← 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 and Cut-Free Tableaux for Propositional Dynamic Logic with Converse (Q5747763) (← links)
• Terminating Tableaux for Hybrid Logic with Eventualities (Q5747764) (← links)