Abstract
This paper presents a framework for reasoning about trustworthiness in cyber-physical systems (CPS) that combines ontology-based reasoning and answer set programming (ASP). It introduces a formal definition of CPS and several problems related to trustworthiness of a CPS such as the problem of identification of the most vulnerable components of the system and of computing a strategy for mitigating an issue. It then shows how a combination of ontology based reasoning and ASP can be used to address the aforementioned problems. The paper concludes with a discussion of the potentials of the proposed methodologies.
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.
There is an unfortunate clash of terminology between OWL properties and CPS properties. Throughout this paper, the intended meaning of the word ‘property’ can be identified from the context of its use.
- 2.
- 3.
- 4.
For simplicity, we often use first order logic atoms in the text which represent all of its ground instantiations.
- 5.
See, e.g., https://potassco.org/clingo/.
- 6.
In the following, we will follow the convention to describe a state s as a subset of F and say that \(f \in s\) is true in s and \(f \not \in s\) is false in s.
- 7.
By loosely-coupled, we mean that the components see each other as black-boxes and only exchange information, via simple interfaces, at the end of their respective computations. Compare this with a tightly-coupled architecture, where the components have a richer interfaces for exchange state information and controlling each other’s execution flow while their computations are still running.
- 8.
References
Balas, E.: Disjunctive programming: Cutting planes from logical conditions. In: Nonlinear Programming, vol. 2, pp. 279–312. Elsevier (1975)
Balduccini, M., Griffor, E., Huth, M., Vishik, C., Burns, M., Wollman, D.A.: Ontology-based reasoning about the trustworthiness of cyber-physical systems. ArXiv abs/1803.07438 (2018)
Balduccini, M., Lierler, Y.: Constraint answer set solver EZCSP and why integration schemas matter. J. Theory Pract. Logic Program. (TPLP) 17(4), 462–515 (2017)
Baral, C.: Knowledge Representation, Reasoning, and Declarative Problem Solving with Answer Sets. Cambridge University Press, Cambridge (2003)
Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. Theory Pract. Logic Program. 9(1), 57–144 (2009)
D’Iddio, A.C., Huth, M.: ManyOpt: an extensible tool for mixed, non-linear optimization through SMT solving. CoRR abs/1702.01332 (2017). http://arxiv.org/abs/1702.01332
Eiter, T.: Answer set programming for the semantic web. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 23–26. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74610-2_3
Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Warren, D., Szeredi, P. (eds.) Logic Programming: Proceedings of the Seventh International Conference, pp. 579–597 (1990)
Gelfond, M., Son, T.C.: Prioritized default theory. In: Selected Papers from the Workshop on Logic Programming and Knowledge Representation, LNAI, vol. 1471, pp. 164–223. Springer, Heidelberg (1998)
Gelfond, M., Lifschitz, V.: Action languages. Electron. Trans. Artif. Intell. 2, 193–210 (1998)
Griffor, E., Greer, C., Wollman, D.A., Burns, M.J.: Framework for cyber-physical systems: volume 1, overview (2017)
Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: A 25-Year Perspective, pp. 375–398 (1999)
Mistr, M., D’Iddio, A.C., Huth, M., Misener, R.: Satisfiability modulo theories for process systems engineering. Eprints for the optimization community, 19 June 2017
Nguyen, T.H., Potelli, E., Son, T.C.: Phylotastic: an experiment in creating, manipulating, and evolving phylogenetic biology workflows using logic programming. TPLP 18(3–4), 656–672 (2018). https://doi.org/10.1017/S1471068418000236
Nguyen, T.H., Son, T.C., Pontelli, E.: Automatic web services composition for phylotastic. In: PADL, pp. 186–202 (2018). https://doi.org/10.1007/978-3-319-73305-0_13
Niemelä, I.: Logic programming with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3,4), 241–273 (1999). https://doi.org/10.1023/A:1018930122475
Ostrowski, M., Schaub, T.: ASP modulo CSP: the clingcon system. J. Theory Pract. Logic Program. (TPLP) 12(4–5), 485–503 (2012)
Roy, A., Kim, D.S., Trivedi, K.S.: Attack countermeasure trees (ACT): towards unifying the constructs of attack and defense trees. Secur. Commun. Netw. 5(8), 929–943 (2012). https://doi.org/10.1002/sec.299
Disclaimer
Official contribution of the National Institute of Standards and Technology; not subject to copyright in the United States. Certain commercial products are identified in order to adequately specify the procedure; this does not imply endorsement or recommendation by NIST, nor does it imply that such products are necessarily the best available for the purpose. Portions of this publication and research effort are made possible through the help and support of NIST via cooperative agreements 70NANB18H257 and 70NANB19H102.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Nguyen, T.H., Son, T.C., Bundas, M., Balduccini, M., Garwood, K.C., Griffor, E.R. (2021). Reasoning About Trustworthiness in Cyber-Physical Systems Using Ontology-Based Representation and ASP. In: Uchiya, T., Bai, Q., Marsá Maestre, I. (eds) PRIMA 2020: Principles and Practice of Multi-Agent Systems. PRIMA 2020. Lecture Notes in Computer Science(), vol 12568. Springer, Cham. https://doi.org/10.1007/978-3-030-69322-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-69322-0_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-69321-3
Online ISBN: 978-3-030-69322-0
eBook Packages: Computer ScienceComputer Science (R0)