On the computational complexity of querying bounds on differences constraints
From MaRDI portal
Publication:1855216
DOI10.1016/0004-3702(95)00008-3zbMath1013.68558MaRDI QIDQ1855216
Paolo Terenziani, Luca Console, Vittorio Brusoni
Publication date: 4 February 2003
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(95)00008-3
68Q25: Analysis of algorithms and problem complexity
68P15: Database theory
68T30: Knowledge representation
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Complexity studies of a temporal constraint propagation algorithm: a statistical analysis, A spectrum of definitions for temporal model-based diagnosis, Querying temporal and spatial constraint networks in PTIME
Cites Work