The following pages link to (Q4539600):
Displaying 8 items.
- Automata-based axiom pinpointing (Q707741) (← links)
- Automata can show PSpace results for description logics (Q948069) (← links)
- The complexity of computing the behaviour of lattice automata on infinite trees (Q2447756) (← links)
- Approximate Unification in the Description Logic $$\mathcal {FL}_0$$ (Q2835862) (← links)
- One-Pass Tableaux for Computation Tree Logic (Q3498455) (← links)
- Automata-Based Axiom Pinpointing (Q3541704) (← links)
- Description Logics (Q3638996) (← links)
- Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ (Q5738984) (← links)
