Querying temporal and spatial constraint networks in PTIME
type: Item
instance of: scholarly article
title: Querying temporal and spatial constraint networks in PTIME
zbMATH Open document ID: 0952.68043
DOI: 10.1016/S0004-3702(00)00055-2
published in: Artificial Intelligence
publication date: 2000-12-12T00:00:00Z
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 1542284
zbMATH Keywords: constraint networks
zbMATH Keywords: constraint databases
zbMATH Keywords: temporal reasoning
zbMATH Keywords: spatial reasoning
zbMATH Keywords: tractable reasoning
zbMATH Keywords: computational complexity
author: Manolis Koubarakis
author: Spiros Skiadopoulos
MaRDI profile type: Publication
cites work: On the representation and querying of sets of possible worlds
cites work: Maintaining knowledge about temporal intervals
cites work: On the computational complexity of querying bounds on differences constraints
cites work: Reasoning about partially ordered events
cites work: From local to global consistency
cites work: Q3493325
cites work: Temporal constraint networks
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: Q4052071
cites work: A Sufficient Condition for Backtrack-Free Search
cites work: The problem of incomplete information in relational databases
cites work: On point-based temporal disjointness
cites work: Efficient algorithms for qualitative reasoning about time
cites work: Qualitative representation of spatial knowledge
cites work: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
cites work: Incomplete Information in Relational Databases
cites work: A unifying approach to temporal constraint reasoning
cites work: Q4197641
cites work: Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
cites work: From local to global consistency in temporal constraint networks
cites work: The complexity of query evaluation in indefinite temporal constraint databases
cites work: Foundations of a functional approach to knowledge representation
cites work: A canonical form for generalized linear constraints
cites work: Reasoning about temporal relations
cites work: Q3330564
cites work: Q5203719
cites work: On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
cites work: Q3818127
cites work: Deciding Linear Inequalities by Computing Loop Residues
cites work: Q4886730
cites work: Reasoning about qualitative temporal information
cites work: The complexity of querying indefinite data about linearly ordered domains
full work available at URL: s0004-3702(00)00055-2
OpenAlex ID: W1596054597
description: scientific article; zbMATH DE number 1542284