Picture for Pierre Bourhis

Pierre Bourhis

University of Lille, CNRS, Inria, Centrale Lille, UMR 9189 CRIStAL

Query Answering with Transitive and Linear-Ordered Data

Add code
Feb 17, 2022
Figure 1 for Query Answering with Transitive and Linear-Ordered Data
Figure 2 for Query Answering with Transitive and Linear-Ordered Data
Figure 3 for Query Answering with Transitive and Linear-Ordered Data
Viaarxiv icon

Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits

Add code
Feb 11, 2022
Figure 1 for Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits
Figure 2 for Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits
Figure 3 for Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits
Figure 4 for Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits
Viaarxiv icon

Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics

Add code
Oct 22, 2020
Figure 1 for Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics
Figure 2 for Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics
Figure 3 for Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics
Figure 4 for Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics
Viaarxiv icon

Oblivious and Semi-Oblivious Boundedness for Existential Rules

Add code
Jun 15, 2020
Viaarxiv icon

Reasoning about disclosure in data integration in the presence of source constraints

Add code
Jun 03, 2019
Figure 1 for Reasoning about disclosure in data integration in the presence of source constraints
Figure 2 for Reasoning about disclosure in data integration in the presence of source constraints
Viaarxiv icon