Resolving over-constrained temporal problems with uncertainty through conflict-directed relaxation

DOI10.1613/JAIR.5431MaRDI QIDQ4591191zbMATH OpenOpenAlexWikidataFDO

Authors Peng Yu, Brian C. Williams, Cheng Fang, Jing Cui, P. Haslum

Publication date 13 November 2017

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.5431

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Recommendations

• scientific article; zbMATH DE number 5215795
• scientific article; zbMATH DE number 2084377
• Publication:3493325
• Principles and Practice of Constraint Programming – CP 2004
• scientific article; zbMATH DE number 5547866

Cited in

(5)

• Extending conditional simple temporal networks with partially shrinkable uncertainty
• scientific article; zbMATH DE number 5215795 (Why is no real title available?)
• Dynamic controllability of temporal networks with instantaneous reaction
• On expected value strong controllability
• Recent algorithmic advances in simple temporal networks with uncertainty: from faster controllability checking to faster execution

This page was built for publication: Resolving over-constrained temporal problems with uncertainty through conflict-directed relaxation

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