The following pages link to Querying the Guarded Fragment (Q5417742):
Displaying 20 items.
- On the data complexity of consistent query answering (Q269317) (← links)
- Towards more expressive ontology languages: the query answering problem (Q359987) (← links)
- Finite satisfiability for guarded fixpoint logic (Q436331) (← links)
- A more general theory of static approximations for conjunctive queries (Q778535) (← links)
- Logical separability of labeled data examples under ontologies (Q2093388) (← links)
- Recent Advances in Datalog$$^\pm $$ (Q2970309) (← links)
- Querying the Unary Negation Fragment with Regular Path Expressions. (Q3305361) (← links)
- Finite model reasoning over existential rules (Q4592706) (← links)
- SOME MODEL THEORY OF GUARDED NEGATION (Q4647097) (← links)
- Guarded Ontology-Mediated Queries (Q5015964) (← links)
- Semiring Provenance for Guarded Logics (Q5015965) (← links)
- (Q5092374) (← links)
- (Q5094143) (← links)
- (Q5232911) (← links)
- Reasoning on anonymity in Datalog (Q5240228) (← links)
- Guarded Negation (Q5890544) (← links)
- Guarded Negation (Q5892612) (← links)
- Answer Counting under Guarded TGDs (Q6076172) (← links)
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments (Q6149592) (← links)
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\) (Q6535408) (← links)
