Linh Anh Nguyen

ExpTime Tableaux for Using Sound Global Caching

We present a simple ExpTime (complexity-optimal) tableau decision procedure based on and-or graphs with sound global caching for checking satisfiability of a concept w.r.t. a TBox in

EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies

\mathcal{ALC}

Constructing the Least Models for Positive Modal Logic Programs

. Our algorithm is easy to implement and provides a foundation for ExpTime (complexity-optimal) tableau-based decision procedures for many modal and description logics, to which various optimisation techniques can be applied.

Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics

The description logic

Multimodal logic programming

\mathcal{SHI}

On bisimulations for description logics

extends the basic description logic

Analytic Tableau Systems and Interpolation for the Modal Logics KB, KDB, K5, KD5

\mathcal{ALC}

An Optimal Tableau Decision Procedure for Converse-PDL

with transitive roles, role hierarchies and inverse roles. The known tableau-based decision procedure [9] for

The Modal Logic Programming System MProlog

\mathcal{SHI}

Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity

exhibit (at least) NEXPTIME behaviour even though