George Katsirelos

Artif. Intell., March, 2024

2023

Learning constraints through partial queries.

[BibT_eX]

[DOI]

Dimosthenis C. Tsouros

Artif. Intell., June, 2023

An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

Virtual Pairwise Consistency in Cost Function Networks.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

2022

Gene regulatory network inference methodology for genomic and transcriptomic data acquired in genetically related heterozygote individuals.

[BibT_eX]

[DOI]

Bioinform., 2022

Learning the structure of Bayesian Networks using constraint programming.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Efficient Low Rank Convex Bounds for Pairwise Discrete Graphical Models.

[BibT_eX]

[DOI]

Valentin Durante

Thomas Schiex

Proceedings of the International Conference on Machine Learning, 2022

Multiple-choice Knapsack Constraint in Graphical Models.

[BibT_eX]

[DOI]

Pierre Montalbano

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

Structured Set Variable Domains in Bayesian Network Structure Learning.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

Parallel Hybrid Best-First Search.

[BibT_eX]

[DOI]

Abdelkader Beldjilali

Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

2021

Efficient semidefinite bounds for multi-label discrete graphical models.

[BibT_eX]

[DOI]

Valentin Durante

Thomas Schiex

CoRR, 2021

Guaranteed Diversity and Optimality in Cost Function Network Based Computational Protein Design Methods.

[BibT_eX]

[DOI]

Algorithms, 2021

Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020

Constraint and Satisfiability Reasoning for Graph Coloring.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2020

Partial Queries for Constraint Acquisition.

[BibT_eX]

[DOI]

Dimosthenis C. Tsouros

CoRR, 2020

Relaxation-Aware Heuristics for Exact Optimization in Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

Chain Length and CSPs Learnable with Few Queries.

[BibT_eX]

[DOI]

Christian Bessiere

Clément Carbonnel

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Clause Learning and New Bounds for Graph Coloring.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Guaranteed Diversity & Quality for the Weighted CSP.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE International Conference on Tools with Artificial Intelligence, 2019

A Hybrid Approach for Exact Coloring of Massive Graphs.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

2018

Conflict Directed Clause Learning for Maximum Weighted Clique Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Clique Cuts in Weighted Constraint Satisfaction.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2017

2016

New Approaches to Constraint Acquisition.

[BibT_eX]

[DOI]

Proceedings of the Data Mining and Constraint Programming, 2016

Multi-language evaluation of exact solvers in graphical model discrete optimization.

[BibT_eX]

[DOI]

Constraints An Int. J., 2016

Ranking Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Finding a Collection of MUSes Incrementally.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

2015

Reasoning about Connectivity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2015

Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014

Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules.

[BibT_eX]

[DOI]

Artif. Intell., 2014

Computational protein design as an optimization problem.

[BibT_eX]

[DOI]

Artif. Intell., 2014

Reasoning about Constraint Models.

[BibT_eX]

[DOI]

Proceedings of the PRICAI 2014: Trends in Artificial Intelligence, 2014

The Balance Constraint Family.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

Relaxation Search: A Simple Way of Managing Optional Clauses.

[BibT_eX]

[DOI]

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

2013

A new framework for computational protein design through cost function network optimization.

[BibT_eX]

[DOI]

Bioinform., 2013

Detecting and Exploiting Subproblem Tractability.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Constraint Acquisition via Partial Queries.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Learning Polynomials over GF(2) in a SAT Solver - (Poster Presentation).

[BibT_eX]

[DOI]

Laurent Simon

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

Eigenvector Centrality in Industrial SAT Instances.

[BibT_eX]

[DOI]

Laurent Simon

Proceedings of the Principles and Practice of Constraint Programming, 2012

The SeqBin Constraint Revisited.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

Computational Protein Design as a Cost Function Network Optimization Problem.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

2011

The Complexity of Integer Bound Propagation.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2011

The weighted Grammar constraint.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

Complexity of and Algorithms for Borda Manipulation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

An Empirical Study of Borda Manipulation

[BibT_eX]

[DOI]

CoRR, 2010

Symmetries of Symmetry Breaking Constraints.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2010, 2010

On the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry.

[BibT_eX]

[DOI]

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

Decomposition of the NValue Constraint.

[BibT_eX]

[DOI]

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

Propagating Conjunctions of AllDifferent Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

A Restriction of Extended Resolution for Clause Learning SAT Solvers.

[BibT_eX]

[DOI]

Gilles Audemard

Laurent Simon

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Nogood Processing in CSPs.

[BibT_eX]

[DOI]

PhD thesis, 2009

Breaking Generator Symmetry

[BibT_eX]

[DOI]

CoRR, 2009

The Weighted CFG Constraint

[BibT_eX]

[DOI]

CoRR, 2009

Circuit Complexity and Decompositions of Global Constraints.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Decompositions of All Different, Global Cardinality and Related Constraints.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Reformulating Global Grammar Constraints.

[BibT_eX]

[DOI]

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

Restricted Global Grammar Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

2008

Combining Symmetry Breaking and Global Constraints.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Constraints, 2008

The Weighted CfgConstraint.

[BibT_eX]

[DOI]

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

2007

A Compression Algorithm for Large Arity Extensional Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2007

2005

Generalized NoGoods in CSPs.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2005

2003

Unrestricted Nogood Recording in CSP Search.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2003

2001

GAC on Conjunctions of Constraints.

[BibT_eX]

[DOI]