Martin C. Cooper

Orcid: 0000-0003-4853-053X

Affiliations:
  • University of Toulouse, IRIT, France


According to our database1, Martin C. Cooper authored at least 115 papers between 1988 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Complexity of minimum-size arc-inconsistency explanations.
Constraints An Int. J., September, 2023

On computing probabilistic abductive explanations.
Int. J. Approx. Reason., August, 2023

Tractability of explaining classifier decisions.
Artif. Intell., March, 2023

Feature Necessity & Relevancy in ML Classifier Explanations.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Tractable Explaining of Multivariate Decision Trees.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Analysis of planning instances without search.
Proceedings of the 17èmes Journées d'Intelligence Artificielle Fondamentale, 2023

Predictive Explanations for and by Reinforcement Learning.
Proceedings of the Agents and Artificial Intelligence - 15th International Conference, 2023

Reinforcement Learning Explained via Reinforcement Learning: Towards Explainable Policies through Predictive Explanation.
Proceedings of the 15th International Conference on Agents and Artificial Intelligence, 2023

Abductive Explanations of Classifiers Under Constraints: Complexity and Properties.
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.
CoRR, 2022

Isomorphisms Between STRIPS Problems and Sub-Problems.
Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

Tractable Explanations for d-DNNF Classifiers.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Efficient Explanations for Knowledge Compilation Languages.
CoRR, 2021

Efficient Explanations With Relevant Sets.
CoRR, 2021

A lightweight epistemic logic and its application to planning.
Artif. Intell., 2021

Explanations for Monotonic Classifiers.
Proceedings of the 38th International Conference on Machine Learning, 2021

On the Tractability of Explaining Decisions of Classifiers.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020
Steepest ascent can be exponential in bounded treewidth problems.
Oper. Res. Lett., 2020

Graphical Models: Queries, Complexity, Algorithms (Tutorial).
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.
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.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Variable Elimination in Binary CSPs (Extended Abstract).
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Galois Connections for Patterns: An Algebra of Labelled Graphs.
Proceedings of the Graph Structures for Knowledge Representation and Reasoning, 2020

Towards Formal Fairness in Machine Learning.
Proceedings of the Principles and Practice of Constraint Programming, 2020

Strengthening Neighbourhood Substitution.
Proceedings of the Principles and Practice of Constraint Programming, 2020

2019
Variable Elimination in Binary CSPs.
J. Artif. Intell. Res., 2019

Binary constraint satisfaction problems defined by excluded topological minors.
Inf. Comput., 2019

The epistemic gossip problem.
Discret. Math., 2019

On Singleton Arc Consistency for CSPs Defined by Monotone Patterns.
Algorithmica, 2019

2018
A polynomial relational class of binary CSP.
Ann. Math. Artif. Intell., 2018

Temporal Epistemic Gossip Problems.
Proceedings of the Multi-Agent Systems - 16th European Conference, 2018

Domain Reduction for Valued Constraints by Generalising Methods from CSP.
Proceedings of the Principles and Practice of Constraint Programming, 2018

2017
Binarisation for Valued Constraint Satisfaction Problems.
SIAM J. Discret. Math., 2017

The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns.
Log. Methods Comput. Sci., 2017

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

Hybrid Tractable Classes of Constraint Problems.
Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

2016
Tractability in constraint satisfaction problems: a survey.
Constraints An Int. J., 2016

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

Simple Epistemic Planning: Generalised Gossiping.
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.
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.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
Variable and value elimination in binary constraint satisfaction via forbidden patterns.
J. Comput. Syst. Sci., 2015

Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns.
Discret. Appl. Math., 2015

Tractable Classes of Binary CSPs Defined by Excluded Topological Minors.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

A Microstructure-Based Family of Tractable Classes for CSPs.
Proceedings of the Principles and Practice of Constraint Programming, 2015

Broken Triangles Revisited.
Proceedings of the Principles and Practice of Constraint Programming, 2015

Binarisation via Dualisation for Valued Constraints.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Monotone Temporal Planning: Tractability, Extensions and Applications.
J. Artif. Intell. Res., 2014

On Broken Triangles.
Proceedings of the Principles and Practice of Constraint Programming, 2014

Monotone Temporal Planning: Tractability, Extensions and Applications - (Extended Abstract).
Proceedings of the Principles and Practice of Constraint Programming, 2014

Beyond Consistency and Substitutability.
Proceedings of the Principles and Practice of Constraint Programming, 2014

On Backdoors to Tractable Constraint Languages.
Proceedings of the Principles and Practice of Constraint Programming, 2014

2013
An Algebraic Theory of Complexity for Discrete Optimization.
SIAM J. Comput., 2013

Managing Temporal cycles in Planning Problems Requiring Concurrency.
Comput. Intell., 2013

Relaxation of Temporal Planning Problems.
Proceedings of the 2013 20th International Symposium on Temporal Representation and Reasoning, 2013

Variable Elimination in Binary CSP via Forbidden Patterns.
Proceedings of the IJCAI 2013, 2013

2012
Tractable Triangles and Cross-Free Convexity in Discrete Optimisation.
J. Artif. Intell. Res., 2012

The Tractability of CSP Classes Defined by Forbidden Patterns.
J. Artif. Intell. Res., 2012

An Algebraic Theory of Complexity for Discrete Optimisation
CoRR, 2012

A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP.
Proceedings of the Principles and Practice of Constraint Programming, 2012

Tractable Monotone Temporal Planning.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

A Dichotomy for 2-Constraint Forbidden CSP Patterns.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Transformation of optimal planning problems.
J. Exp. Theor. Artif. Intell., 2011

The tractability of CSP classes defined by forbidden patterns
CoRR, 2011

A weighted CSP approach to cost-optimal planning.
AI Commun., 2011

Hybrid tractability of valued constraint problems.
Artif. Intell., 2011

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

Hierarchically Nested Convex VCSP.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

On Guaranteeing Polynomially Bounded Search Tree Size.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010
Transformation de problèmes de planification optimale.
Rev. d'Intelligence Artif., 2010

Hybrid tractability of soft constraint problems
CoRR, 2010

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination.
Artif. Intell., 2010

Soft arc consistency revisited.
Artif. Intell., 2010

Solving Temporally-Cyclic Planning Problems.
Proceedings of the TIME 2010, 2010

Compilation of a High-level Temporal Planning Language into PDDL 2.1.
Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010

A New Hybrid Tractable Class of Soft Constraint Problems.
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.
Theor. Comput. Sci., 2008

A Rich Discrete Labeling Scheme for Line Drawings of Curved Objects.
IEEE Trans. Pattern Anal. Mach. Intell., 2008

Measuring the Semantic Distance between Languages from a Statistical Analysis of Bilingual Dictionaries.
J. Quant. Linguistics, 2008

Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency.
Constraints An Int. J., 2008

Hybrid tractable CSPs which generalize tree structure.
Proceedings of the ECAI 2008, 2008

Virtual Arc Consistency for Weighted CSP.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Line Drawing Interpretation.
Springer, ISBN: 978-1-8480-0228-9, 2008

2007
Constraints Between Distant Lines in the Labelling of Line Drawings of Polyhedral Scenes.
Int. J. Comput. Vis., 2007

Optimal Soft Arc Consistency.
Proceedings of the IJCAI 2007, 2007

2006
The complexity of soft constraint satisfaction.
Artif. Intell., 2006

Soft Arc Consistency Applied to Optimal Planning.
Proceedings of the Principles and Practice of Constraint Programming, 2006

An Algebraic Characterisation of Complexity for Valued Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2006

2005
Wireframe Projections: Physical Realisability of Curved Objects and Unambiguous Reconstruction of Simple Polyhedra.
Int. J. Comput. Vis., 2005

Supermodular functions and the complexity of MAX CSP.
Discret. Appl. Math., 2005

High-Order Consistency in Valued Constraint Satisfaction.
Constraints An Int. J., 2005

A Mathematical Model of Historical Semantics and the Grouping of Word Meanings into Concepts.
Comput. Linguistics, 2005

2004
A Maximal Tractable Class of Soft Constraints.
J. Artif. Intell. Res., 2004

Arc consistency for soft constraints.
Artif. Intell., 2004

Cyclic consistency: A local reduction operation for binary valued constraints.
Artif. Intell., 2004

Identifying Efficiently Solvable Cases of Max CSP.
Proceedings of the STACS 2004, 2004

A Complete Characterization of Complexity for Boolean Constraint Optimization Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2004

2003
Reduction operations in fuzzy or valued constraint satisfaction.
Fuzzy Sets Syst., 2003

Soft Constraints: Complexity and Multimorphisms.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2001
The Interpretation of Line Drawings with Contrast Failure and Shadows.
Int. J. Comput. Vis., 2001

2000
Semantic Distance Measures.
Comput. Intell., 2000

Linear constraints for the interpretation of line drawings of curved objects.
Artif. Intell., 2000

1999
Linear-Time Algorithms for Testing the Realisability of Line Drawings of Curved Objects.
Artif. Intell., 1999

1998
The Tractability of Segmentation and Scene Analysis.
Int. J. Comput. Vis., 1998

Constraints, Consistency and Closure.
Artif. Intell., 1998

1997
Interpreting line drawings of curved objects with tangential edges and surfaces.
Image Vis. Comput., 1997

Fundamental Properties of Neighbourhood Substitution in Constraint Satisfaction Problems.
Artif. Intell., 1997

1995
Tractable Constraints on Ordered Domains.
Artif. Intell., 1995

1994
Characterising Tractable Constraints.
Artif. Intell., 1994

A Substitution Operation for Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 1994

1993
Interpretation of line drawings of complex objects.
Image Vis. Comput., 1993

1989
Formal Hierarchical Object Models for Fast Template Matching.
Comput. J., 1989

An Optimal k-Consistency Algorithm.
Artif. Intell., 1989

1988
Efficient systematic analysis of occlusion.
Pattern Recognit. Lett., 1988

Accelerated analysis of occlusion.
Image Vis. Comput., 1988


  Loading...