Implementing a test for tractability

DOI10.1023/B:CONS.0000024049.41091.71zbMATH Open1074.68610OpenAlexW1977364512MaRDI QIDQ1768752FDOQ1768752

Authors: Richard L. Gault, P. Jeavons 

Publication date: 15 March 2005

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:cons.0000024049.41091.71

Recommendations

• Characterising tractable constraints
• scientific article; zbMATH DE number 1670830
• Closure properties of constraints
• scientific article; zbMATH DE number 1008453
• Classifying the Complexity of Constraints Using Finite Algebras

zbMATH Keywords

symmetrycomplexitypolymorphismconstraint languagePolyanna

Mathematics Subject Classification ID

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

Cited In (4)

• A tetrachotomy of ontology-mediated queries with a covering axiom
• The smallest hard trees
• Domain permutation reduction for constraint satisfaction problems
• Representing and solving finite-domain constraint problems using systems of polynomials

This page was built for publication: Implementing a test for tractability

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