The following pages link to Andrea Calì (Q359985):
Displayed 15 items.
- Towards more expressive ontology languages: the query answering problem (Q359987) (← links)
- Tractable reasoning in description logics with functionality constraints (Q1799301) (← links)
- Taming the Infinite Chase: Query Answering under Expressive Relational Constraints (Q2856474) (← links)
- Querying UML Class Diagrams (Q2892755) (← links)
- On the Interaction of Existential Rules and Equality Constraints in Ontology Querying (Q2900513) (← links)
- (Q3045452) (← links)
- (Q3046903) (← links)
- Querying incomplete data over extended ER schemata (Q3577711) (← links)
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web (Q3638227) (← links)
- (Q3639039) (← links)
- (Q4473479) (← links)
- Ontology Querying: Datalog Strikes Back (Q5086214) (← links)
- Query Rewriting under Linear $$\mathcal {EL}$$ Knowledge Bases (Q5268434) (← links)
- Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings (Q5445301) (← links)
- (Q5692388) (← links)