Constants and finite unary relations in qualitative constraint reasoning
From MaRDI portal
(Redirected from Publication:1749385)
Recommendations
- Finite unary relations and qualitative constraint satisfaction
- scientific article; zbMATH DE number 6519660
- Qualitative constraint satisfaction problems: an extended framework with landmarks
- Complexity classification in qualitative temporal constraint reasoning
- The complexity of constraint satisfaction problems (invited talk)
Cites work
- scientific article; zbMATH DE number 44603 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 1149443 (Why is no real title available?)
- scientific article; zbMATH DE number 1998332 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 6747939 (Why is no real title available?)
- A complexity dichotomy for poset constraint satisfaction
- A fast algorithm and Datalog inexpressibility for temporal reasoning
- A model-theoretic view on qualitative constraint reasoning
- A relation-algebraic approach to the region connection calculus
- A survey of homogeneous structures
- A tableau algorithm for description logics with concrete domains and general TBoxes
- A unifying approach to temporal constraint reasoning
- Building tractable disjunctive constraints
- Classifying the Complexity of Constraints Using Finite Algebras
- Conservative constraint satisfaction re-revisited
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- Core-like properties of infinite graphs and structures
- Cores of Countably Categorical Structures
- Datalog and constraint satisfaction with infinite templates
- Decidability of definability
- Equivalence constraint satisfaction problems
- Expressive power and complexity in algebraic logic
- Finite unary relations and qualitative constraint satisfaction
- Maintaining knowledge about temporal intervals
- Model Theory
- Non-dichotomies in Constraint Satisfaction Complexity
- On the algebraic structure of combinatorial problems
- On the complexity of integer programming
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- On topological consistency and realization
- Qualitative constraint satisfaction problems: an extended framework with landmarks
- Qualitative temporal and spatial reasoning revisited
- Querying incomplete information in RDF with SPARQL
- Reasoning about temporal relations
- Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
- Relation algebras of intervals
- SAT vs. search for qualitative temporal reasoning
- The 116 reducts of (ℚ, <, a)
- The complexity of temporal constraint satisfaction problems
- The reducts of the homogeneous binary branching \(C\)-relation
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
- Tractable set constraints
- Weak Composition for Qualitative Spatial and Temporal Reasoning
Cited in
(7)- Computational Short Cuts in Infinite Domain Constraint Satisfaction
- Solving infinite-domain CSPs using the patchwork property
- Expressing quantification in relational calculus by participation constraints
- A model-theoretic view on qualitative constraint reasoning
- Finite unary relations and qualitative constraint satisfaction
- Qualitative constraint satisfaction problems: an extended framework with landmarks
- scientific article; zbMATH DE number 1253959 (Why is no real title available?)
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)
