Qualitative constraint satisfaction problems: an extended framework with landmarks
DOI10.1016/J.ARTINT.2013.05.006zbMATH Open1334.68208OpenAlexW2055595236WikidataQ62042737 ScholiaQ62042737MaRDI QIDQ490417FDOQ490417
Authors: Sanjiang Li, Weiming Liu, Shengsheng Wang 
Publication date: 27 August 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2013.05.006
Recommendations
- scientific article; zbMATH DE number 6519660
- Constants and finite unary relations in qualitative constraint reasoning
- Finite unary relations and qualitative constraint satisfaction
- Decomposition and tractability in qualitative spatial and temporal reasoning
- On the consistency of cardinal direction constraints
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)
Cites Work
- Maintaining knowledge about temporal intervals
- Graph theory
- Reasoning about temporal relations
- Closure properties of constraints
- Classifying the Complexity of Constraints Using Finite Algebras
- Computational geometry. Algorithms and applications.
- Complexity of conservative constraint satisfaction problems
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- A canonical model of the region connection calculus
- Networks of constraints: Fundamental properties and applications to picture processing
- Handbook of Spatial Logics
- Combining topological and size information for spatial reasoning
- Modelling and solving temporal reasoning as propositional satisfiability
- Reasoning about cardinal directions between extended objects: the NP-hardness result
- Reasoning about cardinal directions between extended objects
- The LAMA planner: guiding cost-based anytime planning with landmarks
- Reasoning about qualitative temporal information
- RCC8 binary constraint network can be consistently extended
- Qualitative reasoning with directional relations
- On topological consistency and realization
- The logic of constraint satisfaction
- Reasoning with topological and directional spatial information
- Title not available (Why is that?)
- Equivalence constraint satisfaction problems
- A finite relation algebra with undecidable network satisfaction problem
- Point algebras for temporal reasoning: Algorithms and complexity
Cited In (10)
- Decomposition and tractability in qualitative spatial and temporal reasoning
- Querying incomplete information in RDF with SPARQL
- Constants and finite unary relations in qualitative constraint reasoning
- Finite unary relations and qualitative constraint satisfaction
- A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems
- On redundant topological constraints
- Title not available (Why is that?)
- On tree-preserving constraints
- Qualitative spatial reasoning in a logical framework
- Learning qualitative constraint networks
This page was built for publication: Qualitative constraint satisfaction problems: an extended framework with landmarks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490417)
