Automata-based axiom pinpointing
From MaRDI portal
Publication:707741
DOI10.1007/S10817-010-9181-2zbMATH Open1213.68589DBLPjournals/jar/BaaderP10OpenAlexW2020755561WikidataQ57383691 ScholiaQ57383691MaRDI QIDQ707741FDOQ707741
Authors: Franz Baader, Rafael Peñaloza 
Publication date: 8 October 2010
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-010-9181-2
Recommendations
Formal languages and automata (68Q45) Knowledge representation (68T30) Logic in artificial intelligence (68T27)
Cites Work
- Title not available (Why is that?)
- Axiom Pinpointing in General Tableaux
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- A theory of diagnosis from first principles
- Title not available (Why is that?)
- Attributive concept descriptions with complements
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata-theoretic techniques for modal logics of programs
- An overview of tableau algorithms for description logics
- Automata can show PSpace results for description logics
- Lattice Automata
- Title not available (Why is that?)
- Weighted Muller tree automata and weighted logics
- Weighted Automata and Weighted Logics on Infinite Words
- Finite tree automata with cost functions
- Debugging incoherent terminologies
- Title not available (Why is that?)
- Automata-Based Axiom Pinpointing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Axiom Pinpointing in General Tableaux
Cited In (13)
- An automata view to goal-directed methods
- Tableau reasoning for description logics and its extension to probabilities
- Probabilistic DL reasoning with pinpointing formulas: a Prolog-based approach
- Completion-based generalization inferences for the description logic \(\mathcal{ELOR}\) with subjective probabilities
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Axiom Pinpointing in General Tableaux
- Weighted automata
- Axiom Pinpointing in General Tableaux
- Automata-Based Axiom Pinpointing
- The Bayesian ontology language \(\mathcal {BEL}\)
- The complexity of computing the behaviour of lattice automata on infinite trees
- Approximation in description logics: how weighted tree automata can help to define the required concept comparison measures in \(\mathcal {FL}_0\)
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
Uses Software
This page was built for publication: Automata-based axiom pinpointing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707741)
