Download PDFOpen PDF in browserThe Weak Completion Semantics and Equality17 pages•Published: October 23, 2018AbstractThe weak completion semantics is an integrated and computational cognitive theory which is based on normal logic programs,threevalued Lukasiewicz logic, weak completion, and skeptical abduction. It has been successfully applied – among others – to the suppression task, the selection task, and to human syllogistic reasoning. In order to solve ethical decision problems like – for example – trolley problems, we need to extend the weak completion semantics to deal with actions and causality. To this end we consider normal logic programs and a set E of equations as in the fluent calculus. We formally show that normal logic programs with equality admit a least Emodel under the weak completion semantics and that this Emodel can be computed as the least fixed point of an associated semantic operator. We show that the operator is not continuous in general, but is continuous if the logic program is a propositional, a finiteground, or a finite datalog program and the Herbrand Euniverse is finite. Finally, we show that the weak completion semantics with equality can solve a variety of ethical decision problems like the bystander case, the footbridge case, and the loop case by computing the least Emodel and reasoning with respect to this Emodel. The reasoning process involves counterfactuals which is necessary to model the different ethical dilemmas.Keyphrases: cognitive reasoning, counterfactual reasoning, equational reasoning, ethical decisionmaking, Fluent Calculus, logic programming, ThreeValued Lukasiewicz Logic, Weak Completion In: Gilles Barthe, Geoff Sutcliffe and Margus Veanes (editors). LPAR22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 57, pages 326342
