NDLI: Improving completeness in multi-adjoint logic computations via general reductants

Content Provider	IEEE Xplore Digital Library
Author	Morcillo, P.J. Moreno, G.
Copyright Year	2011
Description	Author affiliation: Department of Computing Systems, University of Castilla-La Mancha, Albacete (02071), Spain (Morcillo, P.J.; Moreno, G.)
Abstract	Fuzzy extensions of logic programming often require the notion of reductant to ensure completeness when working with some lattices modeling the concept of truth degree beyond the simpler case of true and false. Initially introduced in the context of generalized annotated logic programming, some adaptations of this theoretical tool have been proposed for the more recent and flexible framework of multi-adjoint logic programming. To the best of our knowledge, all of them suffer the important problem of usually requiring an infinite set of reductants (one for each ground atom) for being added to a given program in order to guarantee its completeness. The main goal of this paper is the introduction of a generalized notion of reductant, called G-reductant, which only depends on (a finite number of) predicate symbols instead of ground atoms (whose number is always infinite for programs considering at least a non constant function symbol in their signature). More exactly, given a predicate p/n in the signature of a fuzzy program p, we generate just a single G-reductant with head p(X1, … , Xn) (being X1, … , Xn different variable symbols) which covers all the possible calls to p in a completely safe way. Since the number of G-reductants is finite for programs with a finite number of predicates, our notion can be really applied in practice in contrast with older versions of reductants which are only applicable at a non-practical, but purely theoretical level.
Starting Page	138
Ending Page	145
File Size	230168
Page Count	8
File Format	PDF
ISBN	9781424499816
e-ISBN	9781424499823
DOI	10.1109/FOCI.2011.5949467
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-04-11
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Fuzzy logic Context Logic programming Semantics Lattices Syntactics
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Completeness Theorem for Multi-Adjoint Logic Programming (2001)

Multi-Adjoint Logic Programming (2004)

A completeness theorem for multi-adjoint logic programming

Completeness of Unfolding for Rewriting Logic Theories

String-based Multi-adjoint Lattices for Tracing Fuzzy Logic Computations

On the use of fuzzy stable models for inconsistent classical logic programs

Rfuzzy -- a framework for multi-adjoint fuzzy logic programming (2009).

Similarity-based unification: a multi-adjoint approach (2002).

A Procedural Semantics for Multi-Adjoint Logic Programming (2001)

Improving completeness in multi-adjoint logic computations via general reductants

Similar Documents

A Completeness Theorem for Multi-Adjoint Logic Programming (2001)

Multi-Adjoint Logic Programming (2004)

A completeness theorem for multi-adjoint logic programming

Completeness of Unfolding for Rewriting Logic Theories

String-based Multi-adjoint Lattices for Tracing Fuzzy Logic Computations

On the use of fuzzy stable models for inconsistent classical logic programs

Rfuzzy -- a framework for multi-adjoint fuzzy logic programming (2009).

Similarity-based unification: a multi-adjoint approach (2002).

A Procedural Semantics for Multi-Adjoint Logic Programming (2001)

Improving completeness in multi-adjoint logic computations via general reductants