Pierre Bourhis

Orcid: 0000-0001-5699-0320

Affiliations:
  • University of Lille, CNRS, France


According to our database1, Pierre Bourhis authored at least 68 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Ranked Enumeration for MSO on Trees via Knowledge Compilation.
Proceedings of the 27th International Conference on Database Theory, 2024

2023
Reasoning on Feature Models: Compilation-Based vs. Direct Approaches.
CoRR, 2023

On Distances Between Words with Parameters.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022
Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits.
CoRR, 2022

Revisiting Semiring Provenance for Datalog.
Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

2021
Balancing Expressiveness and Inexpressiveness in View Design.
ACM Trans. Database Syst., 2021

Inference from Visible Information and Background Knowledge.
ACM Trans. Comput. Log., 2021

Ranked Enumeration of MSO Logic on Words.
Proceedings of the 24th International Conference on Database Theory, 2021

2020
Monadic Datalog, Tree Validity, and Limited Access Containment.
ACM Trans. Comput. Log., 2020

Making AI Machines Work for Humans in FoW.
SIGMOD Rec., 2020

Constant-Delay Enumeration for Nondeterministic Document Spanners.
SIGMOD Rec., 2020

JSON: Data model and query languages.
Inf. Syst., 2020

Equivalence-Invariant Algebraic Provenance for Hyperplane Update Queries.
Proceedings of the 2020 International Conference on Management of Data, 2020

Data Centric Workflows for Crowdsourcing.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2020

2019
Evaluating Datalog via Tree Automata and Cycluits.
Theory Comput. Syst., 2019

Definability and Interpolation within Decidable Fixpoint Logics.
Log. Methods Comput. Sci., 2019

Ethical Challenges in the Future of Work.
IEEE Data Eng. Bull., 2019

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Oblivious and Semi-Oblivious Boundedness for Existential Rules.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Mixed-World Reasoning with Existential Rules under Active-Domain Semantics.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Reasoning about Disclosure in Data Integration in the Presence of Source Constraints.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Mixed-World Reasoning with Existential Rules under Active Domain Semantics (Abstract).
Proceedings of the 32nd International Workshop on Description Logics, 2019

2018
Query Answering with Transitive and Linear-Ordered Data.
J. Artif. Intell. Res., 2018

Explanations and Transparency in Collaborative Workflows.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Enumeration on Trees under Relabelings.
Proceedings of the 21st International Conference on Database Theory, 2018

2017
JSON: Data model, Query languages and Schema specification.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Making Cross Products and Guarded Ontology Languages Compatible.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Ontology-Mediated Query Answering for Key-Value Stores.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Combined Tractability of Query Evaluation via Tree Automata and Cycluits.
Proceedings of the 20th International Conference on Database Theory, 2017

POLYTICS: Provenance-Based Analytics of Data-Centric Applications.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Characterizing Definability in Decidable Fixpoint Logics.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

A Circuit-Based Approach to Efficient Enumeration.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Bounded Repairability for Regular Tree Languages.
ACM Trans. Database Syst., 2016

Guarded-Based Disjunctive Tuple-Generating Dependencies.
ACM Trans. Database Syst., 2016

Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version).
CoRR, 2016

Tractable Lineages on Treelike Instances: Limits and Extensions.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Querying Visible and Invisible Information.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

A Step Up in Expressiveness of Decidable Fixpoint Logics.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

A Formal Study of Collaborative Access Control in Distributed Datalog.
Proceedings of the 19th International Conference on Database Theory, 2016

Analyzing data-centric applications: Why, what-if, and how-to.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

PROX: Approximated Summarization of Data Provenance.
Proceedings of the 19th International Conference on Extending Database Technology, 2016

2015
Analysis of Schemas with Access Restrictions.
ACM Trans. Database Syst., 2015

Which XML Schemas are Streaming Bounded Repairable?
Theory Comput. Syst., 2015

Highly Expressive Query Languages for Unordered Data Trees.
Theory Comput. Syst., 2015

Querying Visible and Invisible Tables in the Presence of Integrity Constraints.
CoRR, 2015

Provenance Circuits for Trees and Treelike Instances (Extended Version).
CoRR, 2015

Reasonable Highly Expressive Query Languages - IJCAI-15 Distinguished Paper (Honorary Mention).
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Provenance Circuits for Trees and Treelike Instances.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Approximated Summarization of Data Provenance.
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2014
Query Containment for Highly Expressive Datalog Fragments.
CoRR, 2014

Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs.
Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

How to Best Nest Regular Path Queries.
Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

2013
Which DTDs are streaming bounded repairable?
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Access patterns and integrity constraints revisited.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Recursive queries on trees and data trees.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules.
Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013

2012
Comparing workflow specification languages: A matter of views.
ACM Trans. Database Syst., 2012

Querying Schemas With Access Restrictions.
Proc. VLDB Endow., 2012

Monadic Datalog Containment.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
On the dynamics of active documents for distributed data management. (Etude de la dynamique des documents actifs pour la gestion d'information distribuées).
PhD thesis, 2011

2010
AXART - Enabling Collaborative Work with AXML Artifacts.
Proc. VLDB Endow., 2010

2009
The AXML Artifact Model.
Proceedings of the TIME 2009, 2009

Satisfiability and relevance for queries over active documents.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Efficient maintenance techniques for views over active documents.
Proceedings of the EDBT 2009, 2009

2008
Distributed Monitoring of Peer-to-Peer Systems.
Proceedings of the 24th International Conference on Data Engineering, 2008

2007
Incremental View Maintenance for Active Documents.
Proceedings of the 23èmes Journées Bases de Données Avancées, 2007


  Loading...