Resolving Over-Constrained Temporal Problems with Uncertainty through Conflict-Directed Relaxation

DOI10.1613/jair.5431zbMath1419.68210OpenAlexW2765593742WikidataQ129489889 ScholiaQ129489889MaRDI QIDQ4591191

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

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

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

Related Items (2)

Dynamic controllability of temporal networks with instantaneous reaction ⋮ Extending Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty.

This page was built for publication: Resolving Over-Constrained Temporal Problems with Uncertainty through Conflict-Directed Relaxation