Pages that link to "Item:Q2638816"
From MaRDI portal
The following pages link to Terminological reasoning is inherently intractable (Q2638816):
Displayed 19 items.
- Attributive concept descriptions with complements (Q749235) (← links)
- Automata can show PSpace results for description logics (Q948069) (← links)
- A refined architecture for terminological systems: Terminology = Schema + Views (Q1128645) (← links)
- An epistemic operator for description logics (Q1128772) (← links)
- Subsumption computed algebraically (Q1202639) (← links)
- Prototypes in a hybrid language with primitive descriptions (Q1202670) (← links)
- Pattern associativity and the retrieval of semantic networks (Q1202672) (← links)
- Acquisition and validation of complex object database schemata supporting multiple inheritance (Q1330409) (← links)
- An empirical analysis of terminological representation systems (Q1332849) (← links)
- The complexity of concept languages (Q1363785) (← links)
- Consistency checking reduced to satisfiability of concepts in terminological systems (Q1380407) (← links)
- Using automata theory for characterizing the semantics of terminological cycles (Q1380409) (← links)
- Tractable reasoning via approximation (Q1855213) (← links)
- The F-logic approach for description languages (Q1924824) (← links)
- ``Reducing'' classic to practice: Knowledge representation theory meets reality (Q1978452) (← links)
- Computing the least common subsumer w.r.t. a background terminology (Q2372193) (← links)
- Debugging incoherent terminologies (Q2462643) (← links)
- Complexity of Planning in Action Formalisms Based on Description Logics (Q3498484) (← links)
- Unification of concept terms in description logics (Q5929707) (← links)