From local to global consistency in temporal constraint networks
type: Item
instance of: scholarly article
title: From local to global consistency in temporal constraint networks
zbMATH Open document ID: 0902.68016
DOI: 10.1016/S0304-3975(96)00192-2
author: Manolis Koubarakis
published in: Theoretical Computer Science
publication date: 1998-07-23T00:00:00Z
Mathematics Subject Classification ID: 68M99
zbMATH DE Number: 1178639
zbMATH Keywords: global consistency
zbMATH Keywords: temporal constraints
zbMATH Keywords: network algorithm
MaRDI profile type: Publication
cites work: An optimal k-consistency algorithm
cites work: From local to global consistency
cites work: Temporal constraint networks
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: Synthesizing constraint expressions
cites work: A Sufficient Condition for Backtrack-Free Search
cites work: Q4288820
cites work: Principles and practice of constraint programming. 2nd international workshop, PPCP '94, Rosario, Orcas Island, Washington, DC, USA, May 2-4, 1994. Proceedings
cites work: Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
cites work: A canonical form for generalized linear constraints
cites work: Networks of constraints: Fundamental properties and applications to picture processing
cites work: Q3818127
cites work: Reasoning about qualitative temporal information
full work available at URL: s0304-3975(96)00192-2
OpenAlex ID: W1554962133
description: scientific article; zbMATH DE number 1178639