Understanding the complexity of axiom pinpointing in lightweight description logics
type: Item
instance of: scholarly article
title: Understanding the complexity of axiom pinpointing in lightweight description logics
zbMATH Open document ID: 1419.68128
author: Rafael Peñaloza
author: Barış Sertkaya
published in: Artificial Intelligence
publication date: 2017-11-16T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 6807699
zbMATH Keywords: description logics
zbMATH Keywords: axiom pinpointing
zbMATH Keywords: computational complexity
zbMATH Keywords: counting complexity
zbMATH Keywords: enumeration complexity
Wikidata QID: Q114016167
describes a project that uses: Just
describes a project that uses: BEACON
describes a project that uses: BioPortal
describes a project that uses: VoCol
describes a project that uses: EL2MCS
MaRDI profile type: Publication
full work available at URL: j.artint.2017.06.002
OpenAlex ID: W2639976559
cites work: Q4406531
cites work: The DL-Lite Family and Relations
cites work: Towards efficient MUS extraction
cites work: SAT-based MaxSAT algorithms
cites work: Iterative and core-guided maxsat solving: a survey and assessment
cites work: Error-Tolerant Reasoning in the Description Logic $\mathcal{E{\kern-.1em}L}$
cites work: Inconsistency-Tolerant Instance Checking in Tractable Description Logics
cites work: The Bayesian Description Logic ${\mathcal{BEL}}$
cites work: The Bayesian ontology language \(\mathcal {BEL}\)
cites work: Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
cites work: Algorithms for computing minimal unsatisfiable subsets of constraints
cites work: KI 2007: Advances in artificial intelligence. 30th annual German conference on AI, KI 2007, Osnabrück, Germany, September 10--13, 2007. Proceedings
cites work: Automata-based axiom pinpointing
cites work: Axiom Pinpointing in General Tableaux
cites work: On generating all maximal independent sets
cites work: A New Algorithm for Generating All the Maximal Independent Sets
cites work: The complexity of computing the permanent
cites work: The Complexity of Enumeration and Reliability Problems
cites work: Complexity of generalized satisfiability counting problems
cites work: The complexity of facets (and some facets of complexity)
cites work: The complexity of facets resolved
cites work: The even-path problem for graphs and digraphs
cites work: Finding the K Shortest Loopless Paths in a Network
cites work: Finding the \(K\) shortest hyperpaths
cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems
cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms
cites work: Achieving new upper bounds for the hypergraph duality problem through logic
cites work: Redundancy in logic. I: CNF propositional formulae
cites work: Debugging incoherent terminologies
cites work: Complete sets and the polynomial-time hierarchy
cites work: Subtractive reductions and complete problems for counting complexity classes
cites work: Efficient Reasoning for Inconsistent Horn Formulae
cites work: Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
cites work: BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies
cites work: Fast, flexible MUS enumeration
DOI: 10.1016/J.ARTINT.2017.06.002
Recommended article: Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
Recommended article: Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
Recommended article: The complexity of finite model reasoning in description logics
Recommended article: The logical difference for the lightweight description logic \(\mathcal {EL}\)
Recommended article: LTL over description logic axioms
Recommended article: Tractable reasoning and efficient query answering in description logics: The DL-Lite family
description: scientific article; zbMATH DE number 6807699