On the computational complexity of querying bounds on differences constraints

DOI10.1016/0004-3702(95)00008-3zbMath1013.68558OpenAlexW1978078190MaRDI 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

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

• Constraint propagation with interval labels
• Temporal constraint networks
• The logic of constraint satisfaction