default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin C. Cooper
Person information
- affiliation: University of Toulouse, IRIT, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c58]Leila Amgoud, Martin C. Cooper, Salim Debbaoui:
Axiomatic Characterisations of Sample-based Explainers. ECAI 2024: 770-777- [c57]Léo Saulières, Martin C. Cooper
, Florence Dupin de Saint-Cyr:
Backward Explanations via Redefinition of Predicates. ECAI 2024: 786-793 - [c56]Léo Saulières, Martin C. Cooper, Florence Dupin de Saint-Cyr:
Backward explanation via redefinition of predicates. JIAF-JFPDA 2024: 79-89 - [i28]Arnaud Lequen, Martin C. Cooper, Frédéric Maris:
Homomorphisms and Embeddings of STRIPS Planning Models. CoRR abs/2406.16555 (2024) - [i27]Léo Saulières, Martin C. Cooper, Florence Dupin de Saint-Cyr:
Backward explanations via redefinition of predicates. CoRR abs/2408.02606 (2024) - [i26]Leila Amgoud, Martin C. Cooper, Salim Debbaoui:
Axiomatic Characterisations of Sample-based Explainers. CoRR abs/2408.04903 (2024) - [i25]Martin C. Cooper, Leila Amgoud:
Abductive explanations of classifiers under constraints: Complexity and properties. CoRR abs/2409.12154 (2024) - 2023
- [j56]Martin C. Cooper, João Marques-Silva:
Tractability of explaining classifier decisions. Artif. Intell. 316: 103841 (2023) - [j55]Christian Bessiere, Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard:
Complexity of minimum-size arc-inconsistency explanations. Constraints An Int. J. 28(3): 427-449 (2023) - [j54]Yacine Izza, Xuanxiang Huang, Alexey Ignatiev, Nina Narodytska, Martin C. Cooper, João Marques-Silva:
On computing probabilistic abductive explanations. Int. J. Approx. Reason. 159: 108939 (2023) - [c55]Martin C. Cooper, Leila Amgoud:
Abductive Explanations of Classifiers Under Constraints: Complexity and Properties. ECAI 2023: 469-476 - [c54]Léo Saulières, Martin C. Cooper, Florence Bannay:
Reinforcement Learning Explained via Reinforcement Learning: Towards Explainable Policies through Predictive Explanation. ICAART (2) 2023: 35-44 - [c53]Léo Saulières, Martin C. Cooper, Florence Dupin de Saint-Cyr:
Predictive Explanations for and by Reinforcement Learning. ICAART (Revised Selected Paper) 2023: 115-140 - [c52]Martin C. Cooper, Arnaud Lequen, Frédéric Maris:
Analysis of planning instances without search. JIAF 2023: 200-210 - [c51]Clément Carbonnel, Martin C. Cooper, João Marques-Silva:
Tractable Explaining of Multivariate Decision Trees. KR 2023: 127-135 - [c50]Xuanxiang Huang, Martin C. Cooper, António Morgado, Jordi Planes, João Marques-Silva:
Feature Necessity & Relevancy in ML Classifier Explanations. TACAS (1) 2023: 167-186 - 2022
- [c49]Xuanxiang Huang, Yacine Izza, Alexey Ignatiev, Martin C. Cooper, Nicholas Asher, João Marques-Silva:
Tractable Explanations for d-DNNF Classifiers. AAAI 2022: 5719-5728 - [c48]Christian Bessiere, Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard:
Complexity of Minimum-Size Arc-Inconsistency Explanations. CP 2022: 9:1-9:14 - [c47]Martin C. Cooper, Arnaud Lequen, Frédéric Maris:
Isomorphisms Between STRIPS Problems and Sub-Problems. CP 2022: 13:1-13:16 - [i24]Yacine Izza, Alexey Ignatiev, Nina Narodytska, Martin C. Cooper, João Marques-Silva:
Provably Precise, Succinct and Efficient Explanations for Decision Trees. CoRR abs/2205.09569 (2022) - [i23]Xuanxiang Huang, Martin C. Cooper, António Morgado, Jordi Planes, João Marques-Silva:
Feature Necessity & Relevancy in ML Classifier Explanations. CoRR abs/2210.15675 (2022) - [i22]Yacine Izza, Xuanxiang Huang, Alexey Ignatiev, Nina Narodytska, Martin C. Cooper, João Marques-Silva:
On Computing Probabilistic Abductive Explanations. CoRR abs/2212.05990 (2022) - 2021
- [j53]Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris, Elise Perrotin, Pierre Régnier:
A lightweight epistemic logic and its application to planning. Artif. Intell. 298: 103437 (2021) - [c46]Martin C. Cooper, João Marques-Silva:
On the Tractability of Explaining Decisions of Classifiers. CP 2021: 21:1-21:18 - [c45]João Marques-Silva, Thomas Gerspacher, Martin C. Cooper, Alexey Ignatiev, Nina Narodytska:
Explanations for Monotonic Classifiers. ICML 2021: 7469-7479 - [i21]João Marques-Silva, Thomas Gerspacher, Martin C. Cooper, Alexey Ignatiev, Nina Narodytska:
Explanations for Monotonic Classifiers. CoRR abs/2106.00154 (2021) - [i20]Yacine Izza, Alexey Ignatiev, Nina Narodytska, Martin C. Cooper, João Marques-Silva:
Efficient Explanations With Relevant Sets. CoRR abs/2106.00546 (2021) - [i19]Xuanxiang Huang, Yacine Izza, Alexey Ignatiev, Martin C. Cooper, Nicholas Asher, João Marques-Silva:
Efficient Explanations for Knowledge Compilation Languages. CoRR abs/2107.01654 (2021) - 2020
- [j52]David A. Cohen, Martin C. Cooper, Artem Kaznatcheev, Mark Wallace:
Steepest ascent can be exponential in bounded treewidth problems. Oper. Res. Lett. 48(3): 217-224 (2020) - [c44]Martin C. Cooper:
Strengthening Neighbourhood Substitution. CP 2020: 126-142 - [c43]Alexey Ignatiev, Martin C. Cooper, Mohamed Siala, Emmanuel Hebrard, João Marques-Silva:
Towards Formal Fairness in Machine Learning. CP 2020: 846-867 - [c42]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Galois Connections for Patterns: An Algebra of Labelled Graphs. GKR 2020: 125-150 - [c41]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux:
Variable Elimination in Binary CSPs (Extended Abstract). IJCAI 2020: 5035-5039 - [c40]Martin C. Cooper, Andreas Herzig, Frédéric Maris, Elise Perrotin, Julien Vianey:
Lightweight Parallel Multi-Agent Epistemic Planning. KR 2020: 274-283 - [c39]João Marques-Silva, Thomas Gerspacher, Martin C. Cooper, Alexey Ignatiev, Nina Narodytska:
Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay. NeurIPS 2020 - [c38]Martin C. Cooper, Simon de Givry, Thomas Schiex:
Graphical Models: Queries, Complexity, Algorithms (Tutorial). STACS 2020: 4:1-4:22 - [p2]Martin C. Cooper, Simon de Givry, Thomas Schiex:
Valued Constraint Satisfaction Problems. A Guided Tour of Artificial Intelligence Research (2) (II) 2020: 185-207 - [i18]Martin C. Cooper:
Strengthening neighbourhood substitution. CoRR abs/2007.06282 (2020) - [i17]João Marques-Silva, Thomas Gerspacher, Martin C. Cooper, Alexey Ignatiev, Nina Narodytska:
Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay. CoRR abs/2008.05803 (2020)
2010 – 2019
- 2019
- [j51]Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný:
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. Algorithmica 81(4): 1699-1727 (2019) - [j50]Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris, Pierre Régnier:
The epistemic gossip problem. Discret. Math. 342(3): 654-663 (2019) - [j49]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Binary constraint satisfaction problems defined by excluded topological minors. Inf. Comput. 264: 12-31 (2019) - [j48]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux:
Variable Elimination in Binary CSPs. J. Artif. Intell. Res. 66: 589-624 (2019) - [i16]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux:
Variable elimination in binary CSPs. CoRR abs/1905.04209 (2019) - [i15]David A. Cohen, Martin C. Cooper, Artem Kaznatcheev, Mark Wallace:
Steepest ascent can be exponential in bounded treewidth problems. CoRR abs/1911.08600 (2019) - 2018
- [j47]Wafa Jguirim, Wady Naanaa, Martin C. Cooper:
A polynomial relational class of binary CSP. Ann. Math. Artif. Intell. 83(1): 1-20 (2018) - [c37]Martin C. Cooper, Wafa Jguirim, David A. Cohen:
Domain Reduction for Valued Constraints by Generalising Methods from CSP. CP 2018: 64-80 - [c36]Martin C. Cooper, Andreas Herzig, Frédéric Maris, Julien Vianey:
Temporal Epistemic Gossip Problems. EUMAS 2018: 1-14 - [c35]Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný:
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. STACS 2018: 19:1-19:15 - 2017
- [j46]Martin C. Cooper, Stanislav Zivný:
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns. Log. Methods Comput. Sci. 13(4) (2017) - [j45]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Andrei A. Krokhin, Robert Powell, Stanislav Zivný:
Binarisation for Valued Constraint Satisfaction Problems. SIAM J. Discret. Math. 31(4): 2279-2300 (2017) - [p1]Martin C. Cooper, Stanislav Zivný:
Hybrid Tractable Classes of Constraint Problems. The Constraint Satisfaction Problem 2017: 113-135 - [i14]Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný:
On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns. CoRR abs/1704.06215 (2017) - 2016
- [j44]Martin C. Cooper, Aymeric Duchein, Achref El Mouelhi, Guillaume Escamocher, Cyril Terrioux, Bruno Zanuttini:
Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems. Artif. Intell. 234: 196-218 (2016) - [j43]Clément Carbonnel, Martin C. Cooper:
Tractability in constraint satisfaction problems: a survey. Constraints An Int. J. 21(2): 115-144 (2016) - [c34]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux:
Extending Broken Triangles and Enhanced Value-Merging. CP 2016: 173-188 - [c33]Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris, Pierre Régnier:
A Simple Account of Multi-Agent Epistemic Planning. ECAI 2016: 193-201 - [c32]Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris, Pierre Régnier:
Simple Epistemic Planning: Generalised Gossiping. ECAI 2016: 1563-1564 - [c31]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini:
On Broken Triangles. IJCAI 2016: 4135-4139 - [c30]Martin C. Cooper, Stanislav Zivný:
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns. LICS 2016: 652-661 - [i13]Martin C. Cooper, Stanislav Zivný:
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns. CoRR abs/1604.07981 (2016) - [i12]Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris, Pierre Régnier:
Simple epistemic planning: generalised gossiping. CoRR abs/1606.03244 (2016) - [i11]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Andrei A. Krokhin, Robert Powell, Stanislav Zivný:
Binarisation for Valued Constraint Satisfaction Problems. CoRR abs/1608.01628 (2016) - [i10]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Binary Constraint Satisfaction Problems Defined by Excluded Topological Minors. CoRR abs/1608.05358 (2016) - 2015
- [j42]Martin C. Cooper, Guillaume Escamocher:
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns. Discret. Appl. Math. 184: 89-113 (2015) - [j41]David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
Variable and value elimination in binary constraint satisfaction via forbidden patterns. J. Comput. Syst. Sci. 81(7): 1127-1143 (2015) - [c29]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Binarisation via Dualisation for Valued Constraints. AAAI 2015: 3731-3737 - [c28]Martin C. Cooper, Aymeric Duchein, Guillaume Escamocher:
Broken Triangles Revisited. CP 2015: 58-73 - [c27]Martin C. Cooper, Philippe Jégou, Cyril Terrioux:
A Microstructure-Based Family of Tractable Classes for CSPs. CP 2015: 74-88 - [c26]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Tractable Classes of Binary CSPs Defined by Excluded Topological Minors. IJCAI 2015: 1945-1951 - [i9]David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
Variable and value elimination in binary constraint satisfaction via forbidden patterns. CoRR abs/1502.03796 (2015) - 2014
- [j40]Martin C. Cooper, Frederic Maris, Pierre Régnier:
Monotone Temporal Planning: Tractability, Extensions and Applications. J. Artif. Intell. Res. 50: 447-485 (2014) - [c25]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini:
On Broken Triangles. CP 2014: 9-24 - [c24]Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard:
On Backdoors to Tractable Constraint Languages. CP 2014: 224-239 - [c23]Martin C. Cooper:
Beyond Consistency and Substitutability. CP 2014: 256-271 - [c22]Martin C. Cooper, Frederic Maris, Pierre Régnier:
Monotone Temporal Planning: Tractability, Extensions and Applications - (Extended Abstract). CP 2014: 928-932 - [i8]Martin C. Cooper, Stanislav Zivný:
Tractable Triangles and Cross-Free Convexity in Discrete Optimisation. CoRR abs/1401.5855 (2014) - [i7]Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard:
On Backdoors To Tractable Constraint Languages. CoRR abs/1404.3675 (2014) - 2013
- [j39]Martin C. Cooper, Frederic Maris, Pierre Régnier:
Managing Temporal cycles in Planning Problems Requiring Concurrency. Comput. Intell. 29(1): 111-128 (2013) - [j38]David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivný:
An Algebraic Theory of Complexity for Discrete Optimization. SIAM J. Comput. 42(5): 1915-1939 (2013) - [c21]David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
Variable Elimination in Binary CSP via Forbidden Patterns. IJCAI 2013: 517-523 - [c20]Martin C. Cooper, Frederic Maris, Pierre Régnier:
Relaxation of Temporal Planning Problems. TIME 2013: 37-44 - 2012
- [j37]Martin C. Cooper, Stanislav Zivný:
Tractable Triangles and Cross-Free Convexity in Discrete Optimisation. J. Artif. Intell. Res. 44: 455-490 (2012) - [j36]David A. Cohen, Martin C. Cooper, Páidí Creed, Dániel Marx, András Z. Salamon:
The Tractability of CSP Classes Defined by Forbidden Patterns. J. Artif. Intell. Res. 45: 47-78 (2012) - [c19]Martin C. Cooper, Guillaume Escamocher:
A Dichotomy for 2-Constraint Forbidden CSP Patterns. AAAI 2012: 464-470 - [c18]Martin C. Cooper, Frederic Maris, Pierre Régnier:
Tractable Monotone Temporal Planning. ICAPS 2012 - [c17]Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. CP 2012: 265-273 - [i6]Martin C. Cooper, Guillaume Escamocher:
A Dichotomy for 2-Constraint Forbidden CSP Patterns. CoRR abs/1201.3868 (2012) - [i5]David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivný:
An Algebraic Theory of Complexity for Discrete Optimisation. CoRR abs/1207.6692 (2012) - 2011
- [j35]Martin C. Cooper, Stanislav Zivný:
Hybrid tractability of valued constraint problems. Artif. Intell. 175(9-10): 1555-1569 (2011) - [j34]Martin C. Cooper, Marie de Roquemaurel, Pierre Régnier:
A weighted CSP approach to cost-optimal planning. AI Commun. 24(1): 1-29 (2011) - [j33]Martin C. Cooper, Marie de Roquemaurel, Pierre Régnier:
Transformation of optimal planning problems. J. Exp. Theor. Artif. Intell. 23(2): 181-199 (2011) - [c16]David A. Cohen, Martin C. Cooper, Martin James Green, Dániel Marx:
On Guaranteeing Polynomially Bounded Search Tree Size. CP 2011: 160-171 - [c15]Martin C. Cooper, Stanislav Zivný:
Hierarchically Nested Convex VCSP. CP 2011: 187-194 - [c14]Martin C. Cooper, Stanislav Zivný:
Tractable Triangles. CP 2011: 195-209 - [i4]David A. Cohen, Martin C. Cooper, Páidí Creed, András Z. Salamon:
The tractability of CSP classes defined by forbidden patterns. CoRR abs/1103.1542 (2011) - [i3]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
A Maximal Tractable Class of Soft Constraints. CoRR abs/1107.0043 (2011) - 2010
- [j32]Martin C. Cooper, Simon de Givry, Martí Sánchez-Fibla, Thomas Schiex, Matthias Zytnicki, Tomás Werner:
Soft arc consistency revisited. Artif. Intell. 174(7-8): 449-478 (2010) - [j31]Martin C. Cooper, Peter G. Jeavons, András Z. Salamon:
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination. Artif. Intell. 174(9-10): 570-584 (2010) - [j30]Martin C. Cooper, Marie de Roquemaurel, Pierre Régnier:
Transformation de problèmes de planification optimale. Rev. d'Intelligence Artif. 24(4): 465-484 (2010) - [c13]Martin C. Cooper, Stanislav Zivný:
A New Hybrid Tractable Class of Soft Constraint Problems. CP 2010: 152-166 - [c12]Martin C. Cooper, Frederic Maris, Pierre Régnier:
Compilation of a High-level Temporal Planning Language into PDDL 2.1. ICTAI (2) 2010: 181-188 - [c11]Martin C. Cooper, Frederic Maris, Pierre Régnier:
Solving Temporally-Cyclic Planning Problems. TIME 2010: 113-120 - [i2]Martin C. Cooper, Stanislav Zivný:
Hybrid tractability of soft constraint problems. CoRR abs/1008.4071 (2010)
2000 – 2009
- 2008
- [b1]Martin C. Cooper:
Line Drawing Interpretation. Springer 2008, ISBN 978-1-8480-0228-9, pp. I-IX, 1-255 - [j29]Martin C. Cooper:
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency. Constraints An Int. J. 13(4): 437-458 (2008) - [j28]Martin C. Cooper:
Measuring the Semantic Distance between Languages from a Statistical Analysis of Bilingual Dictionaries. J. Quant. Linguistics 15(1): 1-33 (2008) - [j27]Martin C. Cooper:
A Rich Discrete Labeling Scheme for Line Drawings of Curved Objects. IEEE Trans. Pattern Anal. Mach. Intell. 30(4): 741-745 (2008) - [j26]David A. Cohen, Martin C. Cooper, Peter Jeavons:
Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theor. Comput. Sci. 401(1-3): 36-51 (2008) - [c10]Martin C. Cooper, Simon de Givry, Martí Sánchez-Fibla, Thomas Schiex, Matthias Zytnicki:
Virtual Arc Consistency for Weighted CSP. AAAI 2008: 253-258 - [c9]Martin C. Cooper, Peter G. Jeavons, András Z. Salamon:
Hybrid tractable CSPs which generalize tree structure. ECAI 2008: 530-534 - 2007
- [j25]Martin C. Cooper:
Constraints Between Distant Lines in the Labelling of Line Drawings of Polyhedral Scenes. Int. J. Comput. Vis. 73(2): 195-212 (2007) - [c8]Martin C. Cooper, Simon de Givry, Thomas Schiex:
Optimal Soft Arc Consistency. IJCAI 2007: 68-73 - 2006
- [j24]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
The complexity of soft constraint satisfaction. Artif. Intell. 170(11): 983-1016 (2006) - [c7]David A. Cohen, Martin C. Cooper, Peter Jeavons:
An Algebraic Characterisation of Complexity for Valued Constraint. CP 2006: 107-121 - [c6]Martin C. Cooper, Sylvain Cussat-Blanc, Marie de Roquemaurel, Pierre Régnier:
Soft Arc Consistency Applied to Optimal Planning. CP 2006: 680-684 - 2005
- [j23]Martin C. Cooper:
A Mathematical Model of Historical Semantics and the Grouping of Word Meanings into Concepts. Comput. Linguistics 31(2): 227-248 (2005) - [j22]Martin C. Cooper:
High-Order Consistency in Valued Constraint Satisfaction. Constraints An Int. J. 10(3): 283-305 (2005) - [j21]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
Supermodular functions and the complexity of MAX CSP. Discret. Appl. Math. 149(1-3): 53-72 (2005) - [j20]Martin C. Cooper:
Wireframe Projections: Physical Realisability of Curved Objects and Unambiguous Reconstruction of Simple Polyhedra. Int. J. Comput. Vis. 64(1): 69-88 (2005) - 2004
- [j19]Martin C. Cooper, Thomas Schiex:
Arc consistency for soft constraints. Artif. Intell. 154(1-2): 199-227 (2004) - [j18]Martin C. Cooper:
Cyclic consistency: A local reduction operation for binary valued constraints. Artif. Intell. 155(1-2): 69-92 (2004) - [j17]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
A Maximal Tractable Class of Soft Constraints. J. Artif. Intell. Res. 22: 1-22 (2004) - [c5]David A. Cohen, Martin C. Cooper, Peter Jeavons:
A Complete Characterization of Complexity for Boolean Constraint Optimization Problems. CP 2004: 212-226 - [c4]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
Identifying Efficiently Solvable Cases of Max CSP. STACS 2004: 152-163 - 2003
- [j16]Martin C. Cooper:
Reduction operations in fuzzy or valued constraint satisfaction. Fuzzy Sets Syst. 134(3): 311-342 (2003) - [c3]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
Soft Constraints: Complexity and Multimorphisms. CP 2003: 244-258 - [c2]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
A Maximal Tractable Class of Soft Constraints. IJCAI 2003: 209-214 - 2001
- [j15]Martin C. Cooper:
The Interpretation of Line Drawings with Contrast Failure and Shadows. Int. J. Comput. Vis. 43(2): 75-97 (2001) - [i1]Martin C. Cooper, Thomas Schiex:
Arc consistency for soft constraints. CoRR cs.AI/0111038 (2001) - 2000
- [j14]Martin C. Cooper:
Linear constraints for the interpretation of line drawings of curved objects. Artif. Intell. 119(1-2): 235-258 (2000) - [j13]Martin C. Cooper:
Semantic Distance Measures. Comput. Intell. 16(1): 79-94 (2000)
1990 – 1999
- 1999
- [j12]Martin C. Cooper:
Linear-Time Algorithms for Testing the Realisability of Line Drawings of Curved Objects. Artif. Intell. 108(1-2): 31-67 (1999) - 1998
- [j11]Peter Jeavons, David A. Cohen, Martin C. Cooper:
Constraints, Consistency and Closure. Artif. Intell. 101(1-2): 251-265 (1998) - [j10]Martin C. Cooper:
The Tractability of Segmentation and Scene Analysis. Int. J. Comput. Vis. 30(1): 27-42 (1998) - 1997
- [j9]Martin C. Cooper:
Fundamental Properties of Neighbourhood Substitution in Constraint Satisfaction Problems. Artif. Intell. 90(1-2): 1-24 (1997) - [j8]Martin C. Cooper:
Interpreting line drawings of curved objects with tangential edges and surfaces. Image Vis. Comput. 15(4): 263-276 (1997) - 1995
- [j7]Peter Jeavons, Martin C. Cooper:
Tractable Constraints on Ordered Domains. Artif. Intell. 79(2): 327-339 (1995) - 1994
- [j6]Martin C. Cooper, David A. Cohen, Peter Jeavons:
Characterising Tractable Constraints. Artif. Intell. 65(2): 347-361 (1994) - [c1]Peter Jeavons, David A. Cohen, Martin C. Cooper:
A Substitution Operation for Constraints. PPCP 1994: 1-9 - 1993
- [j5]Martin C. Cooper:
Interpretation of line drawings of complex objects. Image Vis. Comput. 11(2): 82-90 (1993)
1980 – 1989
- 1989
- [j4]Martin C. Cooper:
An Optimal k-Consistency Algorithm. Artif. Intell. 41(1): 89-95 (1989) - [j3]Martin C. Cooper:
Formal Hierarchical Object Models for Fast Template Matching. Comput. J. 32(4): 351-361 (1989) - 1988
- [j2]Martin C. Cooper:
Accelerated analysis of occlusion. Image Vis. Comput. 6(1): 3-12 (1988) - [j1]Martin C. Cooper:
Efficient systematic analysis of occlusion. Pattern Recognit. Lett. 7(4): 259-264 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
