Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4406531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DL-Lite Family and Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards efficient MUS extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-based MaxSAT algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative and core-guided maxsat solving: a survey and assessment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-Tolerant Reasoning in the Description Logic $\mathcal{E{\kern-.1em}L}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inconsistency-Tolerant Instance Checking in Tractable Description Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bayesian Description Logic ${\mathcal{BEL}}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bayesian ontology language \(\mathcal {BEL}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing minimal unsatisfiable subsets of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: KI 2007: Advances in artificial intelligence. 30th annual German conference on AI, KI 2007, Osnabrück, Germany, September 10--13, 2007. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-based axiom pinpointing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiom Pinpointing in General Tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of generalized satisfiability counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: The even-path problem for graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the \(K\) shortest hyperpaths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achieving new upper bounds for the hypergraph duality problem through logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy in logic. I: CNF propositional formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Debugging incoherent terminologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtractive reductions and complete problems for counting complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Reasoning for Inconsistent Horn Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, flexible MUS enumeration / rank
 
Normal rank

Latest revision as of 17:21, 14 July 2024

scientific article
Language Label Description Also known as
English
Understanding the complexity of axiom pinpointing in lightweight description logics
scientific article

    Statements

    Understanding the complexity of axiom pinpointing in lightweight description logics (English)
    0 references
    0 references
    0 references
    16 November 2017
    0 references
    description logics
    0 references
    axiom pinpointing
    0 references
    computational complexity
    0 references
    counting complexity
    0 references
    enumeration complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers