4 citations · 6 across the 5 of their papers we have counts for
5 papers
Table-based Quantifier Elimination
Pierre Carbonnelle
Quantifiers make first-order logic more expressive than propositional logic, but they also make solving satisfiability problems more difficult. To solve these problems efficiently,…
Using Symmetries to Lift Satisfiability Checking
Pierre Carbonnelle, Gottfried Schenner, Maurice Bruynooghe +2
We analyze how symmetries can be used to compress structures (also known as interpretations) onto a smaller domain without loss of information. This analysis suggests the possibili…
Interactive Model Expansion in an Observable Environment
Pierre Carbonnelle, Joost Vennekens, Bart Bogaerts +1
Many practical problems can be understood as the search for a state of affairs that extends a fixed partial state of affairs, the \emph{environment}, while satisfying certain condi…
Quantification and Aggregation over Concepts of the Ontology
Pierre Carbonnelle, Matthias Van der Hallen, Marc Denecker
We argue that in some KR applications, we want to quantify over sets of concepts formally represented by symbols in the vocabulary. We show that this quantification should be disti…
Interactive configurator with FO(.) and IDP-Z3
Pierre Carbonnelle, Simon Vandevelde, Joost Vennekens +1
Industry abounds with interactive configuration problems, i.e., constraint solving problems interactively solved by persons with the assistance of a computer. The computer program,…