The following pages link to F. M. Donini (Q989167):
Displaying 29 items.
- The complexity of existential quantification in concept languages. (Q989170) (← links)
- (Q1128642) (redirect page) (← links)
- A refined architecture for terminological systems: Terminology = Schema + Views (Q1128645) (← links)
- An epistemic operator for description logics (Q1128772) (← links)
- The complexity of concept languages (Q1363785) (← links)
- On compact representations of propositional circumscription (Q1391128) (← links)
- Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
- EXPtime tableaux for ALC (Q1589576) (← links)
- Preprocessing of intractable problems (Q1854544) (← links)
- The size of a revised knowledge base (Q1978467) (← links)
- (Q2721183) (← links)
- Automatic support for verification of secure transactions in distributed environment using symbolic model checking (Q2768256) (← links)
- A Unified Framework for Non-standard Reasoning Services in Description Logics (Q2999184) (← links)
- (Q3046832) (← links)
- Computing Utility from Weighted Description Logic Preference Formulas (Q3402248) (← links)
- (Q3624077) (← links)
- (Q4012243) (← links)
- (Q4028788) (← links)
- Deduction in Concept Languages: from Subsumption to Instance Checking (Q4305351) (← links)
- Ground Nonmonotonic Modal Logics (Q4351800) (← links)
- (Q4386924) (← links)
- (Q4506459) (← links)
- (Q4514013) (← links)
- (Q4518911) (← links)
- (Q4533349) (← links)
- On compact representations of propositional circumscription (Q4596622) (← links)
- Spatial layout representation for query-by-sketch content-based image retrieval (Q4792149) (← links)
- A uniform tableaux method for nonmonotonic modal logics (Q5235255) (← links)
- Description logics of minimal knowledge and negation as failure (Q5738954) (← links)
