Multi-adjoint logic programming with continuous semantics

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

Abstract

Considering different implication operators, such as Lukasiewicz, Godel or product implication in the same logic program, naturally leads to the allowance of several adjoint pairs in the lattice of truth-values. In this paper we apply this idea to introduce multi-adjoint logic programs as an extension of monotonic logic programs. The continuity of the immediate consequences operators is proved and the assumptions required to get continuity are further analysed. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

Medina, J., Ojeda-Aciego, M., & Vojtáš, P. (2001). Multi-adjoint logic programming with continuous semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2173 LNAI, pp. 351–364). https://doi.org/10.1007/3-540-45402-0_26

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