A Goal-Directed Decision Procedure for Hybrid PDL

Authors:
Mark Kaminski;Gert Smolka
Affiliations:
Department of Computer Science, University of Oxford, Oxford, UK;Saarland University, Saarbrücken, Germany
Venue:
Journal of Automated Reasoning
Year:
2014

Citing 34
Cited 0

Decision procedures and expressiveness in the temporal logic of branching time

Journal of Computer and System Sciences
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic

Journal of the ACM (JACM) - The MIT Press scientific computation series
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Partial derivatives of regular expressions and finite automaton constructions

Theoretical Computer Science
Derivatives of Regular Expressions

Journal of the ACM (JACM)
The Complexity of Tree Automata and Logics of Programs

SIAM Journal on Computing
Combining deduction and model checking into Tableaux and algorithms for converse-PDL

Information and Computation
Modal logic

Modal logic
Logic for Problem Solving

Logic for Problem Solving
Dynamic Logic

Dynamic Logic
Kleene Algebra with Tests: Completeness and Decidability

CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
The Hybrid µ-Calculus

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Pellet: A practical OWL-DL reasoner

Web Semantics: Science, Services and Agents on the World Wide Web
A Tableau Decision Procedure for $\mathcal{SHOIQ}$

Journal of Automated Reasoning
Optimizing Terminological Reasoning for Expressive Description Logics

Journal of Automated Reasoning
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Models of program logics

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
A General Tableau Method for Deciding Description Logics, Modal Logics and Related First-Order Fragments

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
HTab: a Terminating Tableaux System for Hybrid Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability

Electronic Notes in Theoretical Computer Science (ENTCS)
Terminating Tableau Systems for Hybrid Logic with Difference and Converse

Journal of Logic, Language and Information
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Ontology reasoning in the SHOQ(D) description logic

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A Tableau System for the Modal μ-Calculus

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Regular expressions and the equivalence of programs

Journal of Computer and System Sciences
Spartacus: A Tableau Prover for Hybrid Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Checking Consistency of an ABox w.r.t. Global Assumptions in PDL

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Correctness and worst-case optimality of Pratt-style decision procedures for modal and hybrid logics

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Clausal Tableaux for Hybrid PDL

Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of enriched µ-calculi

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
FaCT++ description logic reasoner: system description

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Optimal and cut-free tableaux for propositional dynamic logic with converse

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Terminating tableaux for hybrid logic with eventualities

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first goal-directed decision procedure for hybrid PDL. The procedure is based on a modular approach that scales from basic modal logic with eventualities to hybrid PDL. The approach is designed so that nominals and eventualities are treated orthogonally. To deal with the complex programs of PDL, the approach employs a novel disjunctive program decomposition. In arguing the correctness of our approach, we employ the novel notion of support generalizing the standard notion of Hintikka sets.