Recommendations
Cites work
- scientific article; zbMATH DE number 5366670 (Why is no real title available?)
- scientific article; zbMATH DE number 67500 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 1181276 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 1989660 (Why is no real title available?)
- scientific article; zbMATH DE number 1765664 (Why is no real title available?)
- scientific article; zbMATH DE number 1765711 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3339435 (Why is no real title available?)
- A lattice-theoretical fixpoint theorem and its applications
- A theory of diagnosis from first principles
- An overview of tableau algorithms for description logics
- Attributive concept descriptions with complements
- Automata can show PSpace results for description logics
- Automata-Based Axiom Pinpointing
- Automata-theoretic techniques for modal logics of programs
- Axiom Pinpointing in General Tableaux
- Axiom Pinpointing in General Tableaux
- Debugging incoherent terminologies
- Finite tree automata with cost functions
- Lattice Automata
- Weighted Automata and Weighted Logics on Infinite Words
- Weighted Muller tree automata and weighted logics
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
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)
