Checking Consistency of an ABox w.r.t. Global Assumptions in PDL

Authors:
Linh Anh Nguyen;Andrzej Szałas
Affiliations:
Institute of Informatics, Warsaw University, Warsaw, Poland. nguyen@mimuw.edu.pl;(Correspd.) Institute of Informatics, Warsaw University, Warsaw, Poland and Department of Computer and Information Science, Linköping University, Sweden. andsz@mimuw.edu.pl
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2010

Citing 18
Cited 5

A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
Reasoning with individuals in concept languages

Data & Knowledge Engineering
Games for the &mgr;-calculus

Theoretical Computer Science
EXPTIME tableaux for ALC

Artificial Intelligence
Combining deduction and model checking into Tableaux and algorithms for converse-PDL

Information and Computation
Dynamic Logic

Dynamic Logic
Reasoning in expressive description logics

Handbook of automated reasoning
Conditional XPath

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Dynamics of Approximate Information Fusion

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability

Electronic Notes in Theoretical Computer Science (ENTCS)
An Efficient Tableau Prover using Global Caching for the Description Logic ALC

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A Tableau Calculus for Regular Grammar Logics with Converse

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Augmenting concept languages by transitive closure of roles: an alternative to terminological cycles

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Data complexity of reasoning in very expressive description logics

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
An Optimal Tableau Decision Procedure for Converse-PDL

KSE '09 Proceedings of the 2009 International Conference on Knowledge and Systems Engineering
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse

Studia Logica

Cut-free exptime tableaux for checking satisfiability of a knowledge base in the description logic ALCI

ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse

Studia Logica
A cut-free exptime tableau decision procedure for the description logic SHI

ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part I
ExpTime Tableaux for Using Sound Global Caching

Journal of Automated Reasoning
A Goal-Directed Decision Procedure for Hybrid PDL

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We reformulate Pratt’s tableau decision procedure of checking satisfiability of a set of formulas in PDL. Our formulation is simpler and its implementation is more direct. Extending the method we give the first ExpTime (optimal) tableau decision procedure not based on transformation for checking consistency of an ABox w.r.t. a TBox in PDL (here, PDL is treated as a description logic). We also prove a new result that the data complexity of the instance checking problem in PDL is coNP-complete.