Declarative semantics of programming in residuated lattice-valued logic

MaRDI QIDQ866211zbMATH OpenFDO

Authors Mingsheng Ying

Publication date 20 February 2007

Published in Science in China. Series E (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Review text

We give two generalizations of Tarski's fixpoint theorem in the setting of residuated lattices and use them to establish van Emdem-Kowalski's least fixpoint semantics for residuated lattice-valued logic programs.

Cited in

(2)

• Lattice-theoretic models of conjectures, hypotheses and consequences
• LATIN 2004: Theoretical Informatics

This page was built for publication: Declarative semantics of programming in residuated lattice-valued logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866211)