In this paper we show that Answer Set Programming (ASP) can accommodate for domain ontologies in modeling and reasoning about Business Processes, especially for process verification. In this work, knowledge on the process domain is expressed in a low-complexity description logic (DL), and terms from the ontology can be used in embedding business rules in the model as well as in expressing constraints that should be verified to achieve compliance by design. Causal rules for reasoning on side-effects of activities in the process domain can be derived, based on knowledge expressed in the DL. We show how ASP can accommodate them, relying on reasoning about actions and change, for process analysis, and, in particular, for verifying formulas in temporal logic.
ASP and ontologies for reasoning on business processes
Giordano L.;Theseider Dupre D.
2019-01-01
Abstract
In this paper we show that Answer Set Programming (ASP) can accommodate for domain ontologies in modeling and reasoning about Business Processes, especially for process verification. In this work, knowledge on the process domain is expressed in a low-complexity description logic (DL), and terms from the ontology can be used in embedding business rules in the model as well as in expressing constraints that should be verified to achieve compliance by design. Causal rules for reasoning on side-effects of activities in the process domain can be derived, based on knowledge expressed in the DL. We show how ASP can accommodate them, relying on reasoning about actions and change, for process analysis, and, in particular, for verifying formulas in temporal logic.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
