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

DOI10.1080/095281399146526MaRDI QIDQ4421240zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Experimental analysis of numeric and symbolic constraint satisfaction techniques for temporal reasoning
• Temporal constraint networks
• scientific article; zbMATH DE number 2043454
• Complexity classification in qualitative temporal constraint reasoning
• Temporal constraints: A survey

Cites work

• scientific article; zbMATH DE number 4062374 (Why is no real title available?)
• scientific article; zbMATH DE number 52880 (Why is no real title available?)
• scientific article; zbMATH DE number 67483 (Why is no real title available?)
• scientific article; zbMATH DE number 4119592 (Why is no real title available?)
• scientific article; zbMATH DE number 795579 (Why is no real title available?)
• Efficient algorithms for qualitative reasoning about time
• Maintaining knowledge about temporal intervals
• On the computational complexity of querying bounds on differences constraints
• Reasoning about temporal relations
• The hardest constraint problems: A double phase transition
• Towards a general theory of action and time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421240)