New tractable classes from old

DOI10.1023/A:1025623111033MaRDI QIDQ1424765zbMATH OpenOpenAlexFDO

Authors David A. Cohen, P. Jeavons, Richard L. Gault

Publication date 15 March 2004

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1025623111033

zbMATH Keywords

complexityconstraint satisfaction problemsdisjunctive constraintstractable classes

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 2080305
• Building tractable disjunctive constraints
• Tractability in constraint satisfaction problems: a survey
• Characterising tractable constraints
• Tractable constraints on ordered domains

Cited in

(16)

• Tractability in constraint satisfaction problems: a survey
• A hybrid tractable class for non-binary CSPs
• Tractable constraints on ordered domains
• A polynomial relational class of binary CSP
• The Effect of Constraint Representation on Structural Tractability
• Principles and Practice of Constraint Programming – CP 2004
• A new tractable class of constraint satisfaction problems
• Partition search for non-binary constraint satisfaction
• Building tractable disjunctive constraints
• An algebraic approach to multi-sorted constraints
• Disjunctions, independence, refinements
• scientific article; zbMATH DE number 2080302 (Why is no real title available?)
• Some new tractable classes of CSPs and their relations with backtracking algorithms
• Typed Guarded Decompositions for Constraint Satisfaction
• scientific article; zbMATH DE number 2080305 (Why is no real title available?)
• Tractability by approximating constraint languages

This page was built for publication: New tractable classes from old

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424765)