Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty

DOI10.1016/j.artint.2018.11.008zbMath1478.68317arXiv1901.02307OpenAlexW2963689531WikidataQ128455346 ScholiaQ128455346MaRDI QIDQ2321284

Brian C. Williams, Nikhil Bhargava

Publication date: 28 August 2019

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.02307

zbMATH Keywords

temporal planningtemporal uncertainty

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Dynamic controllability of temporal networks with instantaneous reaction ⋮ Probabilistic Temporal Networks with Ordinary Distributions: Theory, Robustness and Expected Utility ⋮ Determining temporal agreements in cross-organizational business processes

Cites Work

• Efficient execution of dynamically controllable simple temporal networks with uncertainty
• A new polynomial-time algorithm for linear programming
• Temporal constraint networks
• The polynomial-time hierarchy
• Backtracking algorithms for disjunctions of temporal constraints
• CTP: A new constraint-based formalism for conditional, temporal planning
• On quantified linear implications
• On a decision procedure for quantified linear programs
• Strong Controllability of Disjunctive Temporal Problems with Uncertainty
• Handling contingency in temporal constraint networks: from consistency to controllabilities
• Dynamic Controllability and Dispatchability Relationships

This page was built for publication: Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty