432 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR17 papers
- Université d'ArtoisFR11 papers
- Centre de Recherche en InformatiqueFR4 papers
- Centre de Recherche en Informatique, Signal et Automatique de LilleFR4 papers
- Institut national de recherche en sciences et technologies du numériqueFR3 papers
- Laboratoire Traitement et Communication de l’InformationFR3 papers
- LamsadeFR3 papers
- Laboratoire d'Automatique, de Mécanique et d'Informatique Industrielles et HumainesFR2 papers
- Télécom ParisFR2 papers
- Université de LilleFR2 papers
- Université Paris Dauphine-PSLFR2 papers
- University of BayreuthDE2 papers
17 papers · 1 filter
ASTERYX : A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanations
Ryma Boumazouza, Fahima Cheikh-Alili, Bertrand Mazure +1
The ever increasing complexity of machine learning techniques used more and more in practice, gives rise to the need to explain the predictions and decisions of these models, often…
A Symbolic Approach for Counterfactual Explanations
Ryma Boumazouza, Fahima Cheikh-Alili, Bertrand Mazure +1
In this paper titled A Symbolic Approach for Counterfactual Explanations we propose a novel symbolic approach to provide counterfactual explanations for a classifier predictions. C…
Rectifying Mono-Label Boolean Classifiers
Sylvie Coste-Marquis, Pierre Marquis
We elaborate on the notion of rectification of a Boolean classifier . Given and some background knowledge , postulates characterizing the way must be changed into a n…
On Rational Entailment for Propositional Typicality Logic
Richard Booth, Giovanni Casini, Thomas Meyer +1
Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator capturing the most typical (alias…
QBF as an Alternative to Courcelle's Theorem
Michael Lampis, Stefan Mengel, Valia Mitsou
We propose reductions to quantified Boolean formulas (QBF) as a new approach to showing fixed-parameter linear algorithms for problems parameterized by treewidth. We demonstrate th…
XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems
Frederic Boussemart, Christophe Lecoutre, Gilles Audemard +1
We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated representations of combinatorial constrained problems. This new format is able to deal with mo…
Parameterized Compilation Lower Bounds for Restricted CNF-formulas
Stefan Mengel
We show unconditional parameterized lower bounds in the area of knowledge compilation, more specifically on the size of circuits in decomposable negation normal form (DNNF) that en…
Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets
Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre +4
In this paper, we describe Compact-Table (CT), a bitwise algorithm to enforce Generalized Arc Consistency (GAC) on table con- straints. Although this algorithm is the default propa…
Agenda Separability in Judgment Aggregation
Jérôme Lang, Marija Slavkovik, Srdjan Vesic
One of the better studied properties for operators in judgment aggregation is independence, which essentially dictates that the collective judgment on one issue should not depend o…
A Comparative Study of Ranking-based Semantics for Abstract Argumentation
Elise Bonzon, Jérôme Delobelle, Sébastien Konieczny +1
Argumentation is a process of evaluating and comparing a set of arguments. A way to compare them consists in using a ranking-based semantics which rank-order arguments from the mos…
A partial taxonomy of judgment aggregation rules, and their properties
Jerôme Lang, Gabriella Pigozzi, Marija Slavkovik +2
The literature on judgment aggregation is moving from studying impossibility results regarding aggregation rules towards studying specific judgment aggregation rules. Here we give…
Identifying the Class of Maxi-Consistent Operators in Argumentation
Srdjan Vesic
Dung's abstract argumentation theory can be seen as a general framework for non-monotonic reasoning. An important question is then: what is the class of logics that can be subsumed…
Second-Order Consistencies
Christophe Lecoutre, Stephane Cardon, Julien Vion
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build a…
A Mining-Based Compression Approach for Constraint Satisfaction Problems
Said Jabbour, Lakhdar Sais, Yakoub Salhi
In this paper, we propose an extension of our Mining for SAT framework to Constraint satisfaction Problem (CSP). We consider n-ary extensional constraints (table constraints). Our…
On The Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry
George Katsirelos, Nina Narodytska, Toby Walsh
We consider a common type of symmetry where we have a matrix of decision variables with interchangeable rows and columns. A simple and efficient method to deal with such row and co…
Divide-and-Evolve: a New Memetic Scheme for Domain-Independent Temporal Planning
Marc Schoenauer, Pierre Savéant, Vincent Vidal
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob…
A Simple Model to Generate Hard Satisfiable Instances
Ke Xu, Frederic Boussemart, Fred Hemery +1
In this paper, we try to further demonstrate that the models of random CSP instances proposed by [Xu and Li, 2000; 2003] are of theoretical and practical interest. Indeed, these mo…