Modeling oracles in simple temporal networks with uncertainty

DOI10.1016/J.IC.2025.105382MaRDI QIDQ6884280zbMATH OpenFDO

Authors Franziska S. Hollauf, Roberto Posenato, Carlo Combi, Johann Eder

Publication date 15 December 2025

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2025.105382

zbMATH Keywords

agile controllabilitycontingent durationstemporal constraint networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Controllability (93B05)

Cites work

• A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form
• Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU)
• Dynamic controllability and dispatchability relationships
• Dynamic controllability of simple temporal networks with uncertainty: simple rules and fast real-time execution
• Dynamic controllability of temporal plans in uncertain and partially observable environments
• Efficient execution of dynamically controllable simple temporal networks with uncertainty
• Handling contingency in temporal constraint networks: from consistency to controllabilities
• Probabilistic temporal networks with ordinary distributions: theory, robustness and expected utility
• Quantifying controllability in temporal networks with uncertainty
• Temporal constraint networks

This page was built for publication: Modeling oracles in simple temporal networks with uncertainty

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