Authors:
Matteo Zavatteri
1
and
Luca Viganò
2
Affiliations:
1
University of Verona, Italy
;
2
King's College London, United Kingdom
Keyword(s):
Constraint Networks, Conditional Uncertainty, Controllability, Resource Scheduling, AI-based Security, CNCU.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Constraint Satisfaction
;
Formal Methods
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Planning and Scheduling
;
Simulation and Modeling
;
Symbolic Systems
;
Uncertainty in AI
Abstract:
Constraint Networks (CNs) are a framework to model the constraint satisfaction problem (CSP), which is
the problem of finding an assignment of values to a set of variables satisfying a set of given constraints.
Therefore, CSP is a satisfiability problem. When the CSP turns conditional, consistency analysis extends
to finding also an assignment to these conditions such that the relevant part of the initial CN is consistent.
However, CNs fail to model CSPs expressing an uncontrollable conditional part (i.e., a conditional part that
cannot be decided but merely observed as it occurs). To bridge this gap, in this paper we propose constraint
networks under conditional uncertainty (CNCUs), and we define weak, strong and dynamic controllability of
a CNCU. We provide algorithms to check each of these types of controllability and discuss how to synthesize
(dynamic) execution strategies that drive the execution of a CNCU saying which value to assign to which
variable depending on how
the uncontrollable part behaves. We benchmark the approach by using ZETA, a
tool that we developed for CNCUs. What we propose is fully automated from analysis to simulation.
(More)