Three valued logic of Lukasiewicz for modeling semantics of logic programs

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In order to really understand all aspects of logic-based program development of different semantics, it would be useful to have a common solid logical foundation. The stable semantics are based on G3 but we show that stable semantics can be fully represented in the three valued logic of Łukasiewicz. We construct a particular semantics that we call Ł3-WFS wich is defined over general propositional theories, can be defined via three valued logic of Łukasiewicz. Interesting Ł3-WFS seems to satisfy most of the principles of a well behaved semantics. Hence we propose the three valued Łukasiewicz logic to model WFS, extensions of WFS, and the Stable semantics. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Osorio, M., Borja, V., & Arrazola, J. (2004). Three valued logic of Lukasiewicz for modeling semantics of logic programs. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3315, pp. 343–352). Springer Verlag. https://doi.org/10.1007/978-3-540-30498-2_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free