Constants and finite unary relations in qualitative constraint reasoning

DOI10.1016/j.artint.2017.12.003zbMath1445.68112OpenAlexW2780906569MaRDI QIDQ1749385

Peter Jonsson

Publication date: 16 May 2018

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

Full work available at URL: https://doi.org/10.1016/j.artint.2017.12.003

zbMATH Keywords

computational complexityconstraint satisfactionqualitative reasoning

Mathematics Subject Classification ID

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

Related Items (2)

Solving infinite-domain CSPs using the patchwork property ⋮ Computational Short Cuts in Infinite Domain Constraint Satisfaction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Querying incomplete information in RDF with SPARQL
• Qualitative constraint satisfaction problems: an extended framework with landmarks
• On topological consistency and realization
• A tableau algorithm for description logics with concrete domains and general TBoxes
• Conservative constraint satisfaction re-revisited
• A unifying approach to temporal constraint reasoning
• On the algebraic structure of combinatorial problems
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• Core-like properties of infinite graphs and structures
• Datalog and constraint satisfaction with infinite templates
• Relation algebras of intervals
• A survey of homogeneous structures
• A fast algorithm and datalog inexpressibility for temporal reasoning
• Building tractable disjunctive constraints
• A Model-Theoretic View on Qualitative Constraint Reasoning
• THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING C-RELATION
• Constraint Satisfaction Problems Solvable by Local Consistency Methods
• Reasoning about temporal relations
• Non-dichotomies in Constraint Satisfaction Complexity
• Weak Composition for Qualitative Spatial and Temporal Reasoning
• The complexity of temporal constraint satisfaction problems
• The 116 reducts of (ℚ, <, a)
• On the complexity of integer programming
• Expressive power and complexity in algebraic logic
• Reasoning about temporal relations
• Finite Unary Relations and Qualitative Constraint Satisfaction.
• A complexity dichotomy for poset constraint satisfaction
• Model Theory
• Tractable Set Constraints
• Cores of Countably Categorical Structures
• Classifying the Complexity of Constraints Using Finite Algebras
• Decidability of Definability
• Qualitative Temporal and Spatial Reasoning Revisited
• A relation-algebraic approach to the region connection calculus
• Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning

This page was built for publication: Constants and finite unary relations in qualitative constraint reasoning