An ExpTime Procedure for Description Logic $\mathcal{ALCQI}$ (Draft)
Logic in Computer Science
2007-05-23 v3
Authors:
Yu Ding
Abstract
A worst-case ExpTime tableau-based decision procedure is outlined for the satisfiability problem in ALCQI w.r.t. general axioms.
Cite
@article{arxiv.cs/0703051,
title = {An ExpTime Procedure for Description Logic $\mathcal{ALCQI}$ (Draft)},
author = {Yu Ding},
journal= {arXiv preprint arXiv:cs/0703051},
year = {2007}
}
Comments
This paper is submitted in 2007
Related papers
View all related →
Logic in Computer Science · Computer Science
ExpTime Tableaux with Global Caching for the Description Logic SHOQ
Linh Anh Nguyen, Joanna Golińska-Pilarek
2014-07-22
Logic in Computer Science · Computer Science
ExpTime Tableaux for the Description Logic SHIQ Based on Global State Caching and Integer Linear Feasibility Checking
Linh Anh Nguyen
2014-01-03
Logic in Computer Science · Computer Science
ExpTime Tableaux for Type PDL
Agathoklis Kritsimallis, Ioannis Refanidis
2019-09-04
Logic in Computer Science · Computer Science
Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic SHI
Linh Anh Nguyen
2012-07-17
Artificial Intelligence · Computer Science
The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics
S. Tobies
2011-06-02
Logic in Computer Science · Computer Science
Optimal Tableaux Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-time Temporal Logic ATL+
Serenella Cerrito, Amélie David, Valentin Goranko
2015-05-28
Logic in Computer Science · Computer Science
ExpTime Tableaux with Global Caching for Hybrid PDL
Linh Anh Nguyen
2017-05-03
Logic in Computer Science · Computer Science
Tableau-based decision procedures for logics of strategic ability in multi-agent systems
Valentin Goranko, Dmitry Shkatov
2008-09-09
Logic in Computer Science · Computer Science
Complexity of the Description Logic ALCM
Monica Martinez, Edelweis Rohrer, Paula Severi
2015-11-13
Logic in Computer Science · Computer Science
Optimal Tableau Decision Procedures for PDL
Linh Anh Nguyen, Andrzej Szałas
2011-04-12
Logic in Computer Science · Computer Science
A Faster Tableau for CTL*
Mark Reynolds
2013-07-18
Logic in Computer Science · Computer Science
Generalized Satisfiability for the Description Logic ALC
Arne Meier, Thomas Schneider
2017-07-19
Logic in Computer Science · Computer Science
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard
Bartosz Bednarczyk, Sebastian Rudolph
2021-08-17
Logic in Computer Science · Computer Science
Tableau-based decision procedure for the multi-agent epistemic logic with operators of common and distributed knowledge
Valentin Goranko, Dmitry Shkatov
2016-11-17
Logic in Computer Science · Computer Science
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics
Clemens Kupke, Dirk Pattinson, Lutz Schröder
2021-11-30
Logic in Computer Science · Computer Science
The Probabilistic Description Logic $\mathcal{BALC}$
Leonard Botha, Thomas Meyer, Rafael Peñaloza
2020-09-29
Logic in Computer Science · Computer Science
Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time
Valentin Goranko, Dmitry Shkatov
2019-11-22
Logic · Mathematics
On the complexity of the Leibniz hierarchy
T. Moraschini
2019-08-05
Logic in Computer Science · Computer Science
EXPTIME Tableaux for the Coalgebraic mu-Calculus
Corina Cirstea, Clemens Kupke, Dirk Pattinson
2016-11-23
Logic in Computer Science · Computer Science
A Tableau Method for the Realizability and Synthesis of Reactive Safety Specifications
Montserrat Hermo, Paqui Lucio, César Sánchez
2022-06-06
Logic in Computer Science · Computer Science
A Cut-Free ExpTime Tableau Decision Procedure for the Logic Extending Converse-PDL with Regular Inclusion Axioms
Linh Anh Nguyen
2012-11-13
Logic in Computer Science · Computer Science
SAT-Based ATL Satisfiability Checking
Magdalena Kacprzak, Artur Niewiadomski, Wojciech Penczek
2020-02-11
Logic in Computer Science · Computer Science
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables
Mikhail Rybakov, Dmitry Shkatov
2019-01-23
Computation and Language · Computer Science
AdapTime: Enabling Adaptive Temporal Reasoning in Large Language Models
Yimin Deng, Yejing Wang, Zhenxi Lin, Zichuan Fu +7
2026-04-28
Logic in Computer Science · Computer Science
Description Logics with Two Types of Definite Descriptions: Complexity, Expressiveness, and Automated Deduction
Michał Sochański, Przemysław Andrzej Wałęga, Michał Zawidzki
2025-12-09