liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Checking Consistency of an ABox w.r.t. Global Assumptions in PDL
Warsaw University.
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, The Institute of Technology.
2010 (English)In: Fundamenta Informaticae, ISSN 0169-2968, Vol. 102, no 1, 97-113 p.Article in journal (Refereed) Published
Abstract [en]

We reformulate Pratts 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 Ex PT m E (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.

Place, publisher, year, edition, pages
IOS Press , 2010. Vol. 102, no 1, 97-113 p.
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-62154DOI: 10.3233/FI-2010-299ISI: 000283643700008OAI: diva2:371275
Available from: 2010-11-19 Created: 2010-11-19 Last updated: 2011-02-27

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Szalas, Andrzej
By organisation
KPLAB - Knowledge Processing LabThe Institute of Technology
In the same journal
Fundamenta Informaticae
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 21 hits
ReferencesLink to record
Permanent link

Direct link