Complexity studies of a temporal constraint propagation algorithm: a statistical analysis

DOI10.1080/095281399146526zbMath1053.68685OpenAlexW2013360431MaRDI QIDQ4421240

Debasis Mitra, Nabendu Pal

Publication date: 1999

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/095281399146526

zbMATH Keywords

temporal constraint satisfaction problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Towards a general theory of action and time
• The hardest constraint problems: A double phase transition
• Efficient algorithms for qualitative reasoning about time
• On the computational complexity of querying bounds on differences constraints
• Reasoning about temporal relations

This page was built for publication: Complexity studies of a temporal constraint propagation algorithm: a statistical analysis