Martin C. Cooper

Frédéric Maris

CoRR, 2024

Backward explanation via redefinition of predicates.

[BibT_eX]

[DOI]

Florence Dupin de Saint-Cyr

Proceedings of the 18èmes Journées d'Intelligence Artificielle Fondamentale et 19èmes Journées Francophones sur la Planification, 2024

Backward Explanations via Redefinition of Predicates.

[BibT_eX]

[DOI]

Florence Dupin de Saint-Cyr

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Axiomatic Characterisations of Sample-based Explainers.

[BibT_eX]

[DOI]

Leila Amgoud

Salim Debbaoui

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023

Complexity of minimum-size arc-inconsistency explanations.

[BibT_eX]

[DOI]

Constraints An Int. J., September, 2023

On computing probabilistic abductive explanations.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., August, 2023

Tractability of explaining classifier decisions.

[BibT_eX]

[DOI]

João Marques-Silva

Artif. Intell., March, 2023

Feature Necessity & Relevancy in ML Classifier Explanations.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Tractable Explaining of Multivariate Decision Trees.

[BibT_eX]

[DOI]

Clément Carbonnel

João Marques-Silva

Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Analysis of planning instances without search.

[BibT_eX]

[DOI]

Arnaud Lequen

Frédéric Maris

Proceedings of the 17èmes Journées d'Intelligence Artificielle Fondamentale, 2023

Predictive Explanations for and by Reinforcement Learning.

[BibT_eX]

[DOI]

Florence Dupin de Saint-Cyr

Proceedings of the Agents and Artificial Intelligence - 15th International Conference, 2023

Reinforcement Learning Explained via Reinforcement Learning: Towards Explainable Policies through Predictive Explanation.

[BibT_eX]

[DOI]

Florence Bannay

Proceedings of the 15th International Conference on Agents and Artificial Intelligence, 2023

Abductive Explanations of Classifiers Under Constraints: Complexity and Properties.

[BibT_eX]

[DOI]

Leila Amgoud

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022

Provably Precise, Succinct and Efficient Explanations for Decision Trees.

[BibT_eX]

[DOI]

CoRR, 2022

Isomorphisms Between STRIPS Problems and Sub-Problems.

[BibT_eX]

[DOI]

Arnaud Lequen

Frédéric Maris

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

Tractable Explanations for d-DNNF Classifiers.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Efficient Explanations for Knowledge Compilation Languages.

[BibT_eX]

[DOI]

CoRR, 2021

Efficient Explanations With Relevant Sets.

[BibT_eX]

[DOI]

CoRR, 2021

A lightweight epistemic logic and its application to planning.

[BibT_eX]

[DOI]

Artif. Intell., 2021

Explanations for Monotonic Classifiers.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

On the Tractability of Explaining Decisions of Classifiers.

[BibT_eX]

[DOI]

João Marques-Silva

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020

Steepest ascent can be exponential in bounded treewidth problems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2020

Graphical Models: Queries, Complexity, Algorithms (Tutorial).

[BibT_eX]

[DOI]

Simon de Givry

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Lightweight Parallel Multi-Agent Epistemic Planning.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Variable Elimination in Binary CSPs (Extended Abstract).

[BibT_eX]

[DOI]

Achref El Mouelhi

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Galois Connections for Patterns: An Algebra of Labelled Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Structures for Knowledge Representation and Reasoning, 2020

Towards Formal Fairness in Machine Learning.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2020

Strengthening Neighbourhood Substitution.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2020

Valued Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Simon de Givry

Proceedings of the A Guided Tour of Artificial Intelligence Research: Volume II: AI Algorithms, 2020

2019

Variable Elimination in Binary CSPs.

[BibT_eX]

[DOI]

Achref El Mouelhi

J. Artif. Intell. Res., 2019

Binary constraint satisfaction problems defined by excluded topological minors.

[BibT_eX]

[DOI]

Inf. Comput., 2019

The epistemic gossip problem.

[BibT_eX]

[DOI]

Discret. Math., 2019

On Singleton Arc Consistency for CSPs Defined by Monotone Patterns.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

A polynomial relational class of binary CSP.

[BibT_eX]

[DOI]

Wafa Jguirim

Wady Naanaa

Ann. Math. Artif. Intell., 2018

Temporal Epistemic Gossip Problems.

[BibT_eX]

[DOI]

Proceedings of the Multi-Agent Systems - 16th European Conference, 2018

Domain Reduction for Valued Constraints by Generalising Methods from CSP.

[BibT_eX]

[DOI]

Wafa Jguirim

Proceedings of the Principles and Practice of Constraint Programming, 2018

2017

Binarisation for Valued Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns.

[BibT_eX]

[DOI]

CoRR, 2017

Hybrid Tractable Classes of Constraint Problems.

[BibT_eX]

[DOI]

Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

2016

Tractability in constraint satisfaction problems: a survey.

[BibT_eX]

[DOI]

Clément Carbonnel

Constraints An Int. J., 2016

Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems.

[BibT_eX]

[DOI]

Artif. Intell., 2016

On Broken Triangles.

[BibT_eX]

[DOI]

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

Simple Epistemic Planning: Generalised Gossiping.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

A Simple Account of Multi-Agent Epistemic Planning.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Extending Broken Triangles and Enhanced Value-Merging.

[BibT_eX]

[DOI]

Achref El Mouelhi

Proceedings of the Principles and Practice of Constraint Programming, 2016

2015

Variable and value elimination in binary constraint satisfaction via forbidden patterns.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Tractable Classes of Binary CSPs Defined by Excluded Topological Minors.

[BibT_eX]

[DOI]

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

A Microstructure-Based Family of Tractable Classes for CSPs.

[BibT_eX]

[DOI]

Philippe Jégou

Proceedings of the Principles and Practice of Constraint Programming, 2015

Broken Triangles Revisited.

[BibT_eX]

[DOI]

Aymeric Duchein

Proceedings of the Principles and Practice of Constraint Programming, 2015

Binarisation via Dualisation for Valued Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Monotone Temporal Planning: Tractability, Extensions and Applications.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2014

Monotone Temporal Planning: Tractability, Extensions and Applications - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

Beyond Consistency and Substitutability.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

On Backdoors to Tractable Constraint Languages.

[BibT_eX]

[DOI]

Clément Carbonnel

Emmanuel Hebrard

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

An Algebraic Theory of Complexity for Discrete Optimization.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Managing Temporal cycles in Planning Problems Requiring Concurrency.

[BibT_eX]

[DOI]

Comput. Intell., 2013

Relaxation of Temporal Planning Problems.

[BibT_eX]

[DOI]

Proceedings of the 2013 20th International Symposium on Temporal Representation and Reasoning, 2013

Variable Elimination in Binary CSP via Forbidden Patterns.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

2012

Tractable Triangles and Cross-Free Convexity in Discrete Optimisation.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2012

The Tractability of CSP Classes Defined by Forbidden Patterns.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2012

An Algebraic Theory of Complexity for Discrete Optimisation

[BibT_eX]

[DOI]

CoRR, 2012

A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

Tractable Monotone Temporal Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

A Dichotomy for 2-Constraint Forbidden CSP Patterns.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Transformation of optimal planning problems.

[BibT_eX]

[DOI]

Marie de Roquemaurel

J. Exp. Theor. Artif. Intell., 2011

The tractability of CSP classes defined by forbidden patterns

[BibT_eX]

[DOI]

CoRR, 2011

A weighted CSP approach to cost-optimal planning.

[BibT_eX]

[DOI]

Marie de Roquemaurel

AI Commun., 2011

Hybrid tractability of valued constraint problems.

[BibT_eX]

[DOI]

Artif. Intell., 2011

Tractable Triangles.

[BibT_eX]

[DOI]

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

Hierarchically Nested Convex VCSP.

[BibT_eX]

[DOI]

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

On Guaranteeing Polynomially Bounded Search Tree Size.

[BibT_eX]

[DOI]

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

2010

Transformation de problèmes de planification optimale.

[BibT_eX]

[DOI]

Marie de Roquemaurel

Rev. d'Intelligence Artif., 2010

Hybrid tractability of soft constraint problems

[BibT_eX]

[DOI]

CoRR, 2010

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination.

[BibT_eX]

[DOI]

Peter G. Jeavons

András Z. Salamon

Artif. Intell., 2010

Soft arc consistency revisited.

[BibT_eX]

[DOI]

Artif. Intell., 2010

Solving Temporally-Cyclic Planning Problems.

[BibT_eX]

[DOI]

Proceedings of the TIME 2010, 2010

Compilation of a High-level Temporal Planning Language into PDDL 2.1.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010

A New Hybrid Tractable Class of Soft Constraint Problems.

[BibT_eX]

[DOI]

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

2008

Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

A Rich Discrete Labeling Scheme for Line Drawings of Curved Objects.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2008

Measuring the Semantic Distance between Languages from a Statistical Analysis of Bilingual Dictionaries.

[BibT_eX]

[DOI]

J. Quant. Linguistics, 2008

Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency.

[BibT_eX]

[DOI]

Constraints An Int. J., 2008

Hybrid tractable CSPs which generalize tree structure.

[BibT_eX]

[DOI]

Peter G. Jeavons

András Z. Salamon

Proceedings of the ECAI 2008, 2008

Virtual Arc Consistency for Weighted CSP.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Line Drawing Interpretation.

[BibT_eX]

[DOI]

Springer, ISBN: 978-1-8480-0228-9, 2008

2007

Constraints Between Distant Lines in the Labelling of Line Drawings of Polyhedral Scenes.

[BibT_eX]

[DOI]

Int. J. Comput. Vis., 2007

Optimal Soft Arc Consistency.

[BibT_eX]

[DOI]

Simon de Givry

Proceedings of the IJCAI 2007, 2007

2006

The complexity of soft constraint satisfaction.

[BibT_eX]

[DOI]

Artif. Intell., 2006

Soft Arc Consistency Applied to Optimal Planning.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2006

An Algebraic Characterisation of Complexity for Valued Constraint.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2006

2005

Wireframe Projections: Physical Realisability of Curved Objects and Unambiguous Reconstruction of Simple Polyhedra.

[BibT_eX]

[DOI]

Int. J. Comput. Vis., 2005

Supermodular functions and the complexity of MAX CSP.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

High-Order Consistency in Valued Constraint Satisfaction.

[BibT_eX]

[DOI]

Constraints An Int. J., 2005

A Mathematical Model of Historical Semantics and the Grouping of Word Meanings into Concepts.

[BibT_eX]

[DOI]

Comput. Linguistics, 2005

2004

A Maximal Tractable Class of Soft Constraints.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2004

Arc consistency for soft constraints.

[BibT_eX]

[DOI]

Artif. Intell., 2004

Cyclic consistency: A local reduction operation for binary valued constraints.

[BibT_eX]

[DOI]

Artif. Intell., 2004

Identifying Efficiently Solvable Cases of Max CSP.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

A Complete Characterization of Complexity for Boolean Constraint Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2004

2003

Reduction operations in fuzzy or valued constraint satisfaction.

[BibT_eX]

[DOI]

Fuzzy Sets Syst., 2003

Soft Constraints: Complexity and Multimorphisms.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2003

2001

The Interpretation of Line Drawings with Contrast Failure and Shadows.

[BibT_eX]

[DOI]

Int. J. Comput. Vis., 2001

2000

Semantic Distance Measures.

[BibT_eX]

[DOI]

Comput. Intell., 2000

Linear constraints for the interpretation of line drawings of curved objects.

[BibT_eX]

[DOI]

Artif. Intell., 2000

1999

Linear-Time Algorithms for Testing the Realisability of Line Drawings of Curved Objects.

[BibT_eX]

[DOI]

Artif. Intell., 1999

1998

The Tractability of Segmentation and Scene Analysis.

[BibT_eX]

[DOI]

Int. J. Comput. Vis., 1998

Constraints, Consistency and Closure.

[BibT_eX]

[DOI]

Artif. Intell., 1998

1997

Interpreting line drawings of curved objects with tangential edges and surfaces.

[BibT_eX]

[DOI]

Image Vis. Comput., 1997

Fundamental Properties of Neighbourhood Substitution in Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Artif. Intell., 1997

1995

Tractable Constraints on Ordered Domains.

[BibT_eX]

[DOI]

Artif. Intell., 1995

1994

Characterising Tractable Constraints.

[BibT_eX]

[DOI]

Artif. Intell., 1994

A Substitution Operation for Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 1994

1993

Interpretation of line drawings of complex objects.

[BibT_eX]

[DOI]

Image Vis. Comput., 1993

1989

Formal Hierarchical Object Models for Fast Template Matching.

[BibT_eX]

[DOI]

Comput. J., 1989

An Optimal k-Consistency Algorithm.

[BibT_eX]

[DOI]

Artif. Intell., 1989

1988

Efficient systematic analysis of occlusion.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1988

Accelerated analysis of occlusion.

[BibT_eX]

[DOI]