Disjunctions, independence, refinements
From MaRDI portal
Publication:1614865
DOI10.1016/S0004-3702(02)00224-2zbMATH Open0999.68202MaRDI QIDQ1614865FDOQ1614865
Peter Jonsson, Jochen Renz, Mathias Broxvall
Publication date: 9 September 2002
Published in: Artificial Intelligence (Search for Journal in Brave)
Recommendations
Cites Work
- Consistency in networks of relations
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Reasoning about temporal relations
- Constraint satisfaction over connected row-convex constraints
- A comparison of structural CSP decomposition methods
- Building tractable disjunctive constraints
- On the minimality and global consistency of row-convex constraint networks
- Title not available (Why is that?)
- Tractable constraints on ordered domains
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- A sufficient condition for backtrack-bounded search
- Title not available (Why is that?)
- Benoit Mandelbrot, W. H. Freeman, and the launch of The Fractal Geometry of Nature
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- Composition, indiscernibility, coreferentiality
- Disjunctive and conjunctive multiple-conclusion consequence relations
- DISJUNCTIVITY
- Point algebras for temporal reasoning: Algorithms and complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- An initial study of time complexity in infinite-domain constraint satisfaction
- Solving equation systems in ω-categorical algebras
This page was built for publication: Disjunctions, independence, refinements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1614865)
