Bertrand Mazure

Constraints An Int. J., 2015

On getting rid of the preprocessing minimization step in MUC-finding algorithms.

[BibT_eX]

[DOI]

Constraints An Int. J., 2015

Generalized Qualitative Spatio-Temporal Reasoning: Complexity and Tableau Method.

[BibT_eX]

[DOI]

Michael Sioutis

Jean-François Condotta

Yakoub Salhi

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2015

Ordering Spatio-Temporal Sequences to Meet Transition Constraints: Complexity and Framework.

[BibT_eX]

[DOI]

Michael Sioutis

Jean-François Condotta

Yakoub Salhi

David A. Randell

Proceedings of the Artificial Intelligence Applications and Innovations, 2015

2014

Boosting MUC extraction in unsatisfiable constraint networks.

[BibT_eX]

[DOI]

Appl. Intell., 2014

About Some UP-Based Polynomial Fragments of SAT.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Multiple Contraction through Partial-Max-SAT.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Extensions and Variants of Dalal's Quad Polynomial Fragments of SAT.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Enforcing Solutions in Constraint Networks.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

A Qualitative Spatio-Temporal Framework Based on Point Algebra.

[BibT_eX]

[DOI]

Michael Sioutis

Jean-François Condotta

Yakoub Salhi

Proceedings of the Artificial Intelligence: Methodology, Systems, and Applications, 2014

A General Artificial Intelligence Approach for Skeptical Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Artificial General Intelligence - 7th International Conference, 2014

An Experimentally Efficient Method for (MSS, CoMSS) Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Improving MUC extraction thanks to local search.

[BibT_eX]

[DOI]

CoRR, 2013

Preserving Partial Solutions While Relaxing Constraint Networks.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Questioning the Importance of WCORE-Like Minimization Steps in MUC-Finding Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

Solving E-Squaro through SAT-Coding.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

Computing prime implicants.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Computer-Aided Design, 2013

2012

Relax!

[BibT_eX]

[DOI]

Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

2011

On Freezing and Reactivating Learnt Clauses.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

A CSP Solver Focusing on fac Variables.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010

Boosting Local Search Thanks to cdcl.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009

Using local search to find MSSes and MUSes.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2009

Integrating Conflict Driven Clause Learning to Local Search

[BibT_eX]

[DOI]

Proceedings of the Proceedings 6th International Workshop on Local Search Techniques in Constraint Satisfaction, 2009

Local Autarkies Searching for the Dynamic Partition of CNF Formulae.

[BibT_eX]

[DOI]

Proceedings of the ICTAI 2009, 2009

Learning in Local Search.

[BibT_eX]

[DOI]

Proceedings of the ICTAI 2009, 2009

Does This Set of Clauses Overlap with at Least One MUS?

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2009

2008

Extraction d'ensembles minimaux incohérents basée sur la recherche locale.

[BibT_eX]

[DOI]

Rev. d'Intelligence Artif., 2008

On Finding Minimally Unsatisfiable Cores of CSPS.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2008

On Approaches to Explaining Infeasibility of Sets of Boolean Clauses.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

2007

Local-search Extraction of MUSes.

[BibT_eX]

[DOI]

Constraints An Int. J., 2007

Reducing hard SAT instances to polynomial ones.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Information Reuse and Integration, 2007

Boosting a Complete Technique to Find MSS and MUS Thanks to a Local Search Oracle.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2007, 2007

Eliminating Redundant Clauses in SAT Instances.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

MUST: Provide a Finer-Grained Explanation of Unsatisfiability.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2007

2006

A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE International Conference on Information Reuse and Integration, 2006

Tracking MUSes and Strict Inconsistent Covers.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Computer-Aided Design, 6th International Conference, 2006

Extracting MUSes.

[BibT_eX]

Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

2005

Using Boolean Constraint Propagation for Sub-clauses Deduction.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

Automatic Extraction of Functional Dependencies.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2004

Dealing with Symmetries in Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Gilles Audemard

Proceedings of the SAT 2004, 2004

2003

Eliminating Redundancies in SAT Search Trees.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 2003

2002

About the incremental validation of first-order stratified knowledge-based decision-support systems.

[BibT_eX]

[DOI]

Inf. Sci., 2002

Recovering and Exploiting Structural Knowledge from CNF Formulas.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2002

Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence: Methodology, 2002

1998

Boosting Complete Techniques Thanks to Local Search Methods.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1998

System Description: CRIL Platform for SAT.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 1998

1997

An Efficient Technique to Ensure the Logical Consistency of Interacting Knowledge Bases.

[BibT_eX]

[DOI]

Int. J. Cooperative Inf. Syst., 1997

Tractable Cover Compilations.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

Local Search for Computing Normal Circumstances Models.

[BibT_eX]

[DOI]

Proceedings of the Computational Intelligence, 1997

Checking Several Forms of Consistency in Nonmonotonic Knowledge-Bases.

[BibT_eX]

[DOI]

Proceedings of the Qualitative and Quantitative Practical Reasoning, 1997

Tabu Search for SAT.

[BibT_eX]

[DOI]