Disjunctions, independence, refinements

DOI10.1016/S0004-3702(02)00224-2zbMath0999.68202MaRDI QIDQ1614865

Peter Jonsson, Jochen Renz, Mathias Broxvall

Publication date: 9 September 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

constraint satisfactiontractabilitydisjunctive constraints

Mathematics Subject Classification ID

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

Related Items (4)

An initial study of time complexity in infinite-domain constraint satisfaction ⋮ Solving equation systems in ω-categorical algebras ⋮ Unnamed Item ⋮ Point algebras for temporal reasoning: Algorithms and complexity

Cites Work

• Consistency in networks of relations
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• Constraint satisfaction over connected row-convex constraints
• A comparison of structural CSP decomposition methods
• Building tractable disjunctive constraints
• Benoit Mandelbrot, W. H. Freeman, and the launch of The Fractal Geometry of Nature
• A sufficient condition for backtrack-bounded search
• Reasoning about temporal relations
• On the minimality and global consistency of row-convex constraint networks
• Tractable constraints on ordered domains
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Disjunctions, independence, refinements