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 discuss Zeta, a tool that we developed for CNCUs to carry out an experimental evaluation. What we propose is fully automated from analysis to simulation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Note that \(R_{12}\) and \(R_{1}\) should not be recorded in \( Bucket (V_2)\) and \( Bucket (V_1)\) as they represent the universal relations \(R_{12} = D_1 \times D_2\) and \(R_{1} = D_1\). However, doing so is superfluous but not wrong.
References
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artif. Intell. 49, 61–95 (1991)
Morris, P.H., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. In: IJCAI 2001 (2001)
Hunsberger, L., Posenato, R., Combi, C.: A sound-and-complete propagation-based algorithm for checking the dynamic consistency of conditional simple temporal networks. In: TIME 2015 (2015)
Tsamardinos, I., Vidal, T., Pollack, M.E.: CTP: a new constraint-based formalism for conditional, temporal planning. Constraints 8, 365–388 (2003)
Hunsberger, L., Posenato, R., Combi, C.: The dynamic controllability of conditional STNs with uncertainty. In: PlanEx 2012 (2012)
Zavatteri, M.: Conditional simple temporal networks with uncertainty and decisions. In: TIME 2017. LIPIcs (2017)
Cimatti, A., Hunsberger, L., Micheli, A., Posenato, R., Roveri, M.: Dynamic controllability via timed game automata. Acta Inf. 53, 681–722 (2016)
Cimatti, A., Micheli, A., Roveri, M.: An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty. Artif. Intell. 224, 1–27 (2015)
Cimatti, A., Micheli, A., Roveri, M.: Solving strong controllability of temporal problems with uncertainty using SMT. Constraints 20, 1–29 (2015)
Dechter, R.: Constraint Processing. Elsevier, Amsterdam (2003)
Fargier, H., Lang, J., Schiex, T.: Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge. In: IAAI 1996 (1996)
Mittal, S., Falkenhainer, B.: Dynamic constraint satisfaction problems. In: AAAI 1990 (1990)
Fargier, H., Lang, J.: Uncertainty in constraint satisfaction problems: a probabilistic approach. In: Clarke, M., Kruse, R., Moral, S. (eds.) ECSQARU 1993. LNCS, vol. 747, pp. 97–104. Springer, Heidelberg (1993). https://doi.org/10.1007/BFb0028188
Zavatteri, M., Combi, C., Posenato, R., Viganò, L.: Weak, strong and dynamic controllability of access-controlled workflows under conditional uncertainty. In: Carmona, J., Engels, G., Kumar, A. (eds.) BPM 2017. LNCS, vol. 10445, pp. 235–251. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-65000-5_14
Zavatteri, M., Viganò, L.: Constraint networks under conditional uncertainty. In: 10th International Conference on Agents and Artificial Intelligence (ICAART 2018), vol. 2, pp. 41–52. INSTICC, SciTePress (2018)
Montanari, U.: Networks of constraints: fundamental properties and applications to picture processing. Inf. Sci. 7, 95–132 (1974)
Gottlob, G.: On minimal constraint networks. Artif. Intell. 191–192, 42–60 (2012)
Mackworth, A.K.: Consistency in networks of relations. Artif. Intell. 8, 99–118 (1977)
Freuder, E.C.: A sufficient condition for backtrack-free search. J. ACM 29, 24–32 (1982)
Dechter, R., Pearl, J.: Network-based heuristics for constraint-satisfaction problems. Artif. Int. 34, 1–38 (1987)
Knuth, D.E.: The Art of Computer Programming, Volume I: Fundamental Algorithms. Addison-Wesley, Boston (1968)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)
Luo, X., Lee, J.H.M., Leung, H.F., Jennings, N.R.: Prioritised fuzzy constraint satisfaction problems: axioms, instantiation and validation. Fuzzy Sets Syst. 136, 155–188 (2003)
Combi, C., Viganò, L., Zavatteri, M.: Security constraints in temporal role-based access-controlled workflows. In: Proceedings of the Sixth ACM Conference on Data and Application Security and Privacy, CODASPY 2016. ACM (2016)
Combi, C., Posenato, R., Viganò, L., Zavatteri, M.: Access controlled temporal networks. In: ICAART 2017. INSTICC, ScitePress (2017)
Wang, Q., Li, N.: Satisfiability and resiliency in workflow authorization systems. ACM Trans. Inf. Syst. Secur. 13, 40:1–40:35 (2010). https://dl.acm.org/citation.cfm?id=1880034
Cabanillas, C., Resinas, M., del-Río-Ortega, A., Cortés, A.R.: Specification and automated design-time analysis of the business process human resource perspective. Inf. Syst. 52, 55–82 (2015)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Zavatteri, M., Viganò, L. (2019). Conditional Uncertainty in Constraint Networks. In: van den Herik, J., Rocha, A. (eds) Agents and Artificial Intelligence. ICAART 2018. Lecture Notes in Computer Science(), vol 11352. Springer, Cham. https://doi.org/10.1007/978-3-030-05453-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-05453-3_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05452-6
Online ISBN: 978-3-030-05453-3
eBook Packages: Computer ScienceComputer Science (R0)