The following pages link to Automata-based axiom pinpointing (Q707741):
Displaying 10 items.
- Completion-based generalization inferences for the description logic \(\mathcal{ELOR}\) with subjective probabilities (Q465595) (← links)
- Tableau reasoning for description logics and its extension to probabilities (Q1653448) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- Weighted automata (Q2074206) (← links)
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies (Q2352492) (← links)
- The Bayesian ontology language \(\mathcal {BEL}\) (Q2362495) (← links)
- The complexity of computing the behaviour of lattice automata on infinite trees (Q2447756) (← links)
- Probabilistic DL Reasoning with Pinpointing Formulas: A Prolog-based Approach (Q4957185) (← links)
- Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ (Q5738984) (← links)
- An Automata View to Goal-Directed Methods (Q5738990) (← links)
