Computing multiple-valued logic programs.

James J. Lu; Jacques Calmet; Joachim Schü

Mathware and Soft Computing (1997)

  • Volume: 4, Issue: 2, page 129-153
  • ISSN: 1134-5632

Abstract

top
The logic of signed formula can be used to reason about a wide variety of multiple-valued logics [Häh94b, LMR97]. The formal theoretical foundation of multiple-valued logic programming based on signed formulas is set forth in [Lu96]. The current paper is an investigation into the operational semantics of such signed logic programming. The connection of signed logic programming to constraint logic programming is presented, search space issues are briefly discussed for both general and special cases, and applications to bilattice logic programming and truth-maintenance are analyzed.

How to cite

top

Lu, James J., Calmet, Jacques, and Schü, Joachim. "Computing multiple-valued logic programs.." Mathware and Soft Computing 4.2 (1997): 129-153. <http://eudml.org/doc/39104>.

@article{Lu1997,
abstract = {The logic of signed formula can be used to reason about a wide variety of multiple-valued logics [Häh94b, LMR97]. The formal theoretical foundation of multiple-valued logic programming based on signed formulas is set forth in [Lu96]. The current paper is an investigation into the operational semantics of such signed logic programming. The connection of signed logic programming to constraint logic programming is presented, search space issues are briefly discussed for both general and special cases, and applications to bilattice logic programming and truth-maintenance are analyzed.},
author = {Lu, James J., Calmet, Jacques, Schü, Joachim},
journal = {Mathware and Soft Computing},
keywords = {Programación lógica; Lógica multivaluada; Inteligencia artificial; Signatura; Formulación; operational semantics; bilattice logic programming; truth-maintenance},
language = {eng},
number = {2},
pages = {129-153},
title = {Computing multiple-valued logic programs.},
url = {http://eudml.org/doc/39104},
volume = {4},
year = {1997},
}

TY - JOUR
AU - Lu, James J.
AU - Calmet, Jacques
AU - Schü, Joachim
TI - Computing multiple-valued logic programs.
JO - Mathware and Soft Computing
PY - 1997
VL - 4
IS - 2
SP - 129
EP - 153
AB - The logic of signed formula can be used to reason about a wide variety of multiple-valued logics [Häh94b, LMR97]. The formal theoretical foundation of multiple-valued logic programming based on signed formulas is set forth in [Lu96]. The current paper is an investigation into the operational semantics of such signed logic programming. The connection of signed logic programming to constraint logic programming is presented, search space issues are briefly discussed for both general and special cases, and applications to bilattice logic programming and truth-maintenance are analyzed.
LA - eng
KW - Programación lógica; Lógica multivaluada; Inteligencia artificial; Signatura; Formulación; operational semantics; bilattice logic programming; truth-maintenance
UR - http://eudml.org/doc/39104
ER -

NotesEmbed ?

top

You must be logged in to post comments.