Disjunctions, independence, refinements
From MaRDI portal
Publication:1614865
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)
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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