Abstract
In this chapter, we discuss how considered Logic Programming-based reasoning features are synthesized in three different systems: Acorda, Probabilistic EPA, and Qualm. Whereas the development of Qualm is a contribution of this book, Acorda and Probabilistic EPA are two existing systems that have been developed earlier, but not with any specific wide principled implementation of morality in mind. Though these systems share its main feature, viz., abduction, each system concern itself with a particular combination of features. Moreover, their shared feature, abduction, implements different techniques, indicating the progress made in the development of these three systems. The three systems are employed to model, here, for the first time, different issues of considered moral facets, depending on the need of their respective combination of features.
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.
- 2.
Predicate query / 3 does not explicitly specify a parameter for query-time. In this case, the query-time always refers to the current timestamp. Alternatively, Qualm also provides query(Query, In, Out, QTime), which allows specifying a particular query-time QTime.
References
Alferes, J.J., Pereira, L.M.: NegAbdual meta-interpreter (2007). http://centria.di.fct.unl.pt/~lmp/software/contrNeg.rar
Alferes, J.J., Brogi, A., Leite, J.A., Pereira, L.M.: Evolving logic programs. In: Proceedings of the European Conference on Artificial Intelligence (JELIA 2002). LNCS, pp. 50–61. Springer, New York (2002)
Alferes, J.J., Brogi, A., Leite, J.A., Pereira, L.M.: Evolp meta-interpreter (2002). http://centria.di.fct.unl.pt/~jja/updates
Alferes, J.J., Pereira, L.M., Swift, T.: Abduction in well-founded semantics and generalized stable models via tabled dual programs. Theory Pract. Log. Program. 4(4), 383–428 (2004)
Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. Theory Pract. Log. Program. 9(1), 57–144 (2009)
Castro, L., Swift, T., Warren, D.S.: XASP: answer set programming with XSB and Smodels. The XSB System Version 3.6 Manual, vol. 2, Libraries, Interfaces, and Packages (2015)
Ceruelo, V.P.: Negative non-ground queries in well founded semantics. Master’s thesis, Universidade Nova de Lisboa (2009)
Dell’Acqua, P., Pereira, L.M.: Preferential theory revision. J. Appl. Log. 5(4), 586–601 (2007)
Han, T.A.: Evolution prospection with intention recognition via computational logic. Master’s thesis, Technische Universität Dresden and Universidade Nova de Lisboa (2009)
Han, T.A., Ramli, C.D.K., Damásio, C.V.: An implementation of extended P-log using XASP. In: Proceedings of the 24th International Conference on Logic Programming (ICLP). LNCS, vol. 5366. Springer, New York (2008)
Lopes, G.: A computational approach to introspective consciousness in logic programming: ACORDA. Master’s thesis, Universidade Nova de Lisboa (2006)
Lopes, G., Pereira, L.M.: Prospective programming with ACORDA. In: Empirically Successful Computerized Reasoning (ESCoR 2006) Workshop, IJCAR (2006)
Niemelä, I., Simons, P.: Smodels: an implementation of the stable model and well-founded semantics for normal LP. In: Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). LNAI, vol. 1265 (1997)
Pereira, L.M., Han, T.A.: Evolution prospection. In: Proceedings of the 1st KES International Symposium on Intelligent Decision Technologies (IDT), vol. 199, pp. 139–150 (2009)
Pereira, L.M., Lopes, G.: Prospective logic agents. Int. J. Reason.-Based Intell. Syst. 1(3/4), 200–208 (2009)
Riguzzi, F., Swift, T.: The PITA system: tabling and answer subsumption for reasoning under uncertainty. Theory Pract. Log. Program. 11(4–5), 433–449 (2011)
Saptawijaya, A., Pereira, L.M.: Joint tabling of logic program abductions and updates (Technical communication of ICLP 2014). Theory Pract. Log. Program. 14(4–5) (2014). Online Supplement http://arxiv.org/abs/1405.2058
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Pereira, L.M., Saptawijaya, A. (2016). Logic Programming Systems Affording Morality Experiments. In: Programming Machine Ethics. Studies in Applied Philosophy, Epistemology and Rational Ethics, vol 26. Springer, Cham. https://doi.org/10.1007/978-3-319-29354-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-29354-7_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29353-0
Online ISBN: 978-3-319-29354-7
eBook Packages: Religion and PhilosophyPhilosophy and Religion (R0)