dc.contributor.author Lu, James J. dc.contributor.author Calmet, Jacques dc.contributor.author Schü, Joachim dc.date.accessioned 2007-09-14T11:30:34Z dc.date.available 2007-09-14T11:30:34Z dc.date.issued 1997 dc.identifier.issn 1134-5632 dc.identifier.uri http://hdl.handle.net/2099/3488 dc.description.abstract The logic of signed formula can be used to reason about a wide variety of multiple-valued logics \cite{hah94,lmr96}. The formal theoretical foundation of multiple-valued logic programming based on signed formulas is set forth in \cite{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. dc.format.extent 129-153 dc.language.iso eng dc.publisher Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica dc.relation.ispartof Mathware & soft computing . 1997 Vol. 4 Núm. 2 dc.rights Reconeixement-NoComercial-CompartirIgual 3.0 Espanya dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/es/ dc.subject.other Logic for artificial intelligence dc.subject.other Multiple-valued logic dc.subject.other Signed formula dc.subject.other Constraint logic programming dc.subject.other Truth-maintenance dc.subject.other Bilattices dc.title Computing multiple-valued logic programs dc.type Article dc.subject.lemac Lògica matemàtica dc.subject.ams Classificació AMS::03 Mathematical logic and foundations::03B General logic dc.rights.access Open Access
﻿

Este ítem aparece en la(s) siguiente(s) colección(ones)

Salvo que se indique lo contrario, los contenidos de esta obra estan sujetos a la licencia de Creative Commons: Reconocimiento-NoComercial-SinObraDerivada 3.0 España