3 papers
cs.LO2026
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,…
cs.LO2023
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…
cs.AI2023
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…