Complexity Bounds for the Controllability of Temporal Networks with Conditions, Disjunctions, and Uncertainty

01/08/2019
by   Nikhil Bhargava, et al.
0

In temporal planning, many different temporal network formalisms are used to model real world situations. Each of these formalisms has different features which affect how easy it is to determine whether the underlying network of temporal constraints is consistent. While many of the simpler models have been well-studied from a computational complexity perspective, the algorithms developed for advanced models which combine features have very loose complexity bounds. In this paper, we provide tight completeness bounds for strong, weak, and dynamic controllability checking of temporal networks that have conditions, disjunctions, and temporal uncertainty. Our work exposes some of the subtle differences between these different structures and, remarkably, establishes a guarantee that all of these problems are computable in PSPACE.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2021

The Complexity of Learning Linear Temporal Formulas from Examples

In this paper we initiate the study of the computational complexity of l...
research
10/10/2011

Uncertainty in Soft Temporal Constraint Problems:A General Framework and Controllability Algorithms forThe Fuzzy Case

In real-life temporal scenarios, uncertainty and preferences are often e...
research
12/10/2012

The Dynamic Controllability of Conditional STNs with Uncertainty

Recent attempts to automate business processes and medical-treatment pro...
research
10/06/2020

Tight Polynomial Bounds for Loop Programs in Polynomial Space

We consider the following problem: given a program, find tight asymptoti...
research
02/27/2013

Model-Based Diagnosis with Qualitative Temporal Uncertainty

In this paper we describe a framework for model-based diagnosis of dynam...
research
04/07/2012

Characterization of Dynamic Bayesian Network

In this report, we will be interested at Dynamic Bayesian Network (DBNs)...
research
05/04/2015

Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: a Singly-Exponential Time DC-Checking

Conditional Simple Temporal Network (CSTN) is a constraint-based graph-f...

Please sign up or login with your details

Forgot password? Click here to reset