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

Direct link
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse
2011 (English)In: Studia Logica: An International Journal for Symbolic Logic, ISSN 0039-3215, E-ISSN 1572-8730, Vol. 98, no 3, 387-428Article in journal (Refereed) Published
Abstract [en]

Grammar logics were introduced by Fariñas del Cerro and Penttonen in 1988 and have been widely studied. In this paper we consider regular grammar logics with converse (REG c logics) and present sound and complete tableau calculi for the general satisfiability problem of REG c logics and the problem of checking consistency of an ABox w.r.t. a TBox in a REG c logic. Using our calculi we develop ExpTime (optimal) tableau decision procedures for the mentioned problems, to which various optimization techniques can be applied. We also prove a new result that the data complexity of the instance checking problem in REG clogics is coNP-complete.

Keyword [en]
Modal logic, regular grammar logics with converse, automated reasoning, tableaux, global caching
National Category
Computer Science
Identifiers
urn:nbn:se:liu:diva-72694 (URN)10.1007/s11225-011-9341-3 (DOI)oai:DiVA.org:liu-72694 (OAI)diva2:461546 (DiVA)
Available from2011-12-05 Created:2011-12-05 Last updated:2011-12-12

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Nguyen, Linh AnhSzalas, Andrzej
By organisation
KPLAB - Knowledge Processing LabThe Institute of Technology
In the same journal
Studia Logica: An International Journal for Symbolic Logic
Computer Science

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: 18 hits
ReferencesLink to record
Permanent link

Direct link