Constants and finite unary relations in qualitative constraint reasoning

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

Cites Work

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

Cited In (4)

Computational Short Cuts in Infinite Domain Constraint Satisfaction
Solving infinite-domain CSPs using the patchwork property
Expressing quantification in relational calculus by participation constraints
Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749385)