Qualitative constraint satisfaction problems: an extended framework with landmarks

DOI10.1016/j.artint.2013.05.006zbMath1334.68208OpenAlexW2055595236WikidataQ62042737 ScholiaQ62042737MaRDI QIDQ490417

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

zbMATH Keywords

constraint satisfactionlandmarksqualitative calculiqualitative spatial and temporal reasoning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Querying incomplete information in RDF with SPARQL, On redundant topological constraints, On tree-preserving constraints, Constants and finite unary relations in qualitative constraint reasoning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Reasoning about cardinal directions between extended objects: the NP-hardness result
• Qualitative reasoning with directional relations
• Point algebras for temporal reasoning: Algorithms and complexity
• On topological consistency and realization
• Reasoning about cardinal directions between extended objects
• The logic of constraint satisfaction
• Reasoning about qualitative temporal information
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• Combining topological and size information for spatial reasoning
• Networks of constraints: Fundamental properties and applications to picture processing
• Modelling and solving temporal reasoning as propositional satisfiability
• RCC8 binary constraint network can be consistently extended
• REASONING WITH TOPOLOGICAL AND DIRECTIONAL SPATIAL INFORMATION
• Complexity of conservative constraint satisfaction problems
• The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
• Handbook of Spatial Logics
• A Canonical Model of the Region Connection Calculus
• Reasoning about temporal relations
• Closure properties of constraints
• A finite relation algebra with undecidable network satisfaction problem
• Classifying the Complexity of Constraints Using Finite Algebras