Constants and finite unary relations in qualitative constraint reasoning
type: Item
instance of: scholarly article
title: Constants and finite unary relations in qualitative constraint reasoning
zbMATH Open document ID: 1445.68112
author: Peter Jonsson
published in: Artificial Intelligence
publication date: 2018-05-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6869121
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: qualitative reasoning
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.artint.2017.12.003
OpenAlex ID: W2780906569
cites work: Maintaining knowledge about temporal intervals
cites work: Constraint Satisfaction Problems Solvable by Local Consistency Methods
cites work: Core-like properties of infinite graphs and structures
cites work: Cores of Countably Categorical Structures
cites work: Q4649542
cites work: Qualitative Temporal and Spatial Reasoning Revisited
cites work: Datalog and constraint satisfaction with infinite templates
cites work: Non-dichotomies in Constraint Satisfaction Complexity
cites work: Tractable Set Constraints
cites work: A Model-Theoretic View on Qualitative Constraint Reasoning
cites work: THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING C-RELATION
cites work: The complexity of temporal constraint satisfaction problems
cites work: A fast algorithm and datalog inexpressibility for temporal reasoning
cites work: Decidability of Definability
cites work: Conservative constraint satisfaction re-revisited
cites work: Classifying the Complexity of Constraints Using Finite Algebras
cites work: Q3995219
cites work: Building tractable disjunctive constraints
cites work: A relation-algebraic approach to the region connection calculus
cites work: Q4828516
cites work: Relation algebras of intervals
cites work: Expressive power and complexity in algebraic logic
cites work: Q4003410
cites work: Q3457245
cites work: On the algebraic structure of combinatorial problems
cites work: Finite Unary Relations and Qualitative Constraint Satisfaction.
cites work: A unifying approach to temporal constraint reasoning
cites work: Q4386965
cites work: The 116 reducts of (ℚ, <, a)
cites work: A complexity dichotomy for poset constraint satisfaction
cites work: Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
cites work: Q5283013
cites work: Reasoning about temporal relations
cites work: On topological consistency and realization
cites work: Qualitative constraint satisfaction problems: an extended framework with landmarks
cites work: Q4432966
cites work: Weak Composition for Qualitative Spatial and Temporal Reasoning
cites work: A tableau algorithm for description logics with concrete domains and general TBoxes
cites work: A survey of homogeneous structures
cites work: Model Theory
cites work: Querying incomplete information in RDF with SPARQL
cites work: On the complexity of integer programming
cites work: On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
DOI: 10.1016/J.ARTINT.2017.12.003
description: scientific article; zbMATH DE number 6869121