Scholar
David Carral
Google Scholar ID: 5bEOMysAAAAJ
Inria, LIRMM, University of Montpellier, CNRS
Citations & Impact
Citations
488
H-index
12
i10-index
15
Publications
20
Co-authors
7
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Published papers in 2024: 'Finite Groundings for ASP with Functions: A Journey through Consistency'; 'Ontology-Based Query Answering over Datalog-Expressible Rule Sets is Undecidable'; 'Rule-aware Datalog Fact Explanation Using Group-SAT Solver'. Published papers in 2023: 'Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination'; 'General Acyclicity and Cyclicity Notions for the Disjunctive Skolem Chase'; 'Testing Logical Diagrams in Power Plants: A Tale of LTL Model Checking'. Published papers in 2022: 'A Journey to the Frontiers of Query Rewritability'; 'An Efficient Algorithm for Reasoning over OWL EL Ontologies with Nominal Schemas'; 'Deciding Hyperproperties Combined with Functional Specifications'; 'Normalisations of Existential Rules: Not so Innocuous!'. Published paper in 2021: 'Capturing Homomorphism-Closed Decidable Queries with Existential Rules'.
Research Experience
- CRCN Researcher at Inria, within the Sophia Antipolis - Méditerranée Centre. Member of the Boreal research team, LIRMM, University of Montpellier, and CNRS.
Background
- Research interests include the study of logical languages (mostly first-order logic, existential rules, and Description Logics) and their theoretical/computational properties. Specific research questions include: If a first-order theory without equality is rewritable or has the bounded-treewidth model property, does it also have the finite model property? If a first-order theory is rewritable and has the finite universal model property, is it also uniformly bounded? What are the expressivity limits of first-order languages that are decidable or semi-decidable? What is the query complexity of solving boolean query entailment over existential rule theories that are rewritable? What is the undecidability status of checking if an existential rule theory is rewritable? If we can decide boolean conjunctive query entailment for a fragment of existential rules, can we also decide chase termination for this fragment?
Miscellany
- Born in 1989; Spanish national; based in Montpellier, France.
