M. C. Cooper

From MaRDI portal
Person:204901

Available identifiers

zbMath Open cooper.martin-cDBLP04/5623WikidataQ46752419 ScholiaQ46752419MaRDI QIDQ204901

List of research outcomes





PublicationDate of PublicationType
Valued constraint satisfaction problems2024-09-11Paper
Complexity of minimum-size arc-inconsistency explanations2024-02-14Paper
Feature necessity \& relevancy in ML classifier explanations2023-12-13Paper
On computing probabilistic abductive explanations2023-07-18Paper
Tractability of explaining classifier decisions2023-06-19Paper
Graphical Models: Queries, Complexity, Algorithms2023-02-07Paper
Tractable constraints on ordered domains2022-09-21Paper
A lightweight epistemic logic and its application to planning2021-11-02Paper
Galois connections for patterns: an algebra of labelled graphs2021-08-04Paper
Hybrid Tractable Classes of Constraint Problems2021-06-15Paper
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns2020-08-05Paper
Variable Elimination in Binary CSPs2019-11-26Paper
On singleton arc consistency for CSPs defined by monotone patterns2019-04-25Paper
The epistemic gossip problem2019-01-22Paper
Binary constraint satisfaction problems defined by excluded topological minors2018-12-21Paper
A polynomial relational class of binary CSP2018-07-20Paper
https://portal.mardi4nfdi.de/entity/Q45761752018-07-12Paper
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46007682018-01-12Paper
Tractability in constraint satisfaction problems: a survey2016-04-20Paper
Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems2016-03-08Paper
Variable and value elimination in binary constraint satisfaction via forbidden patterns2015-07-13Paper
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns2015-04-28Paper
Monotone Temporal Planning: Tractability, Extensions and Applications2014-07-30Paper
An Algebraic Theory of Complexity for Discrete Optimization2014-02-04Paper
Managing temporal cycles in planning problems requiring concurrency2013-11-01Paper
The Tractability of CSP Classes Defined by Forbidden Patterns2012-12-03Paper
Tractable triangles and cross-free convexity in discrete optimisation2012-08-27Paper
A Mathematical Model of Historical Semantics and the Grouping of Word Meanings into Concepts2012-03-20Paper
A weighted CSP approach to cost-optimal planning2011-12-01Paper
Hybrid tractability of valued constraint problems2011-11-17Paper
Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination2010-09-02Paper
Principles and Practice of Constraint Programming – CP 20032010-03-02Paper
Minimization of locally defined submodular functions by optimal soft arc consistency2009-05-29Paper
https://portal.mardi4nfdi.de/entity/Q35494452008-12-23Paper
An Algebraic Characterisation of Complexity for Valued Constraint2008-09-09Paper
Principles and Practice of Constraint Programming – CP 20042008-09-09Paper
Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms2008-07-31Paper
The complexity of soft constraint satisfaction2007-10-23Paper
STACS 20042007-10-01Paper
High-order consistency in valued constraint satisfaction2006-02-23Paper
Arc consistency for soft constraints2006-02-07Paper
Cyclic consistency: A local reduction operation for binary valued constraints2006-02-07Paper
Wireframe projections: physical realisability of curved objects and unambiguous reconstruction of simple polyhedra2006-01-09Paper
https://portal.mardi4nfdi.de/entity/Q57156752006-01-04Paper
Supermodular functions and the complexity of MAX CSP2005-09-02Paper
Fundamental properties of neighbourhood substitution in constraint satisfaction problems2003-08-28Paper
Reduction operations in fuzzy or valued constraint satisfaction2003-05-19Paper
Tractable constraints on ordered domains2003-02-04Paper
The interpretation of line drawings with contrast failure and shadows2001-11-06Paper
Linear constraints for the interpretation of line drawings of curved objects2000-08-21Paper
Linear-time algorithms for testing the realisability of line drawings of curved objects1999-04-28Paper
Constraints, consistency and closure1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q43362061997-11-10Paper
Characterising tractable constraints1994-05-03Paper
Estimating optimal parameters for parallel database hardware1992-06-28Paper
An optimal k-consistency algorithm1989-01-01Paper

Research outcomes over time

This page was built for person: M. C. Cooper