A completeness theorem for multi-adjoint logic programming

被引：0

作者：

Medina, J ^{[1
]}

Ojeda-Aciego, M ^{[1
]}

Vojtás, P ^{[1
]}

机构：

[1] Univ Malaga, Dept Matemat Aplicada, E-29071 Malaga, Spain

来源：

10TH IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-3: MEETING THE GRAND CHALLENGE: MACHINES THAT SERVE PEOPLE | 2001年

关键词：

approximate reasoning; fuzzy logic programming; completeness results; continuous fix-point semantics;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Multi-adjoint logic programs generalise monotonic and residuated logic programs [1] in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. As our approach has continuous fixpoint semantics, in this work, a procedural semantics is given for the paradigm of multi-adjoint logic programming and a completeness result is proved. Some applications which could benefit from this theoretical approach, such as threshold computation, fuzzy databases and general fuzzy resolution, are commented on.

引用

页码：1031 / 1034

页数：4

共 9 条

[1]

DAMASIO C, 2001, LECT NOTES ARTIF INT, V2143, P760

[2] Hybrid probabilistic programs [J].

Dekhtyar, A ;

Subrahmanian, VS .

JOURNAL OF LOGIC PROGRAMMING, 2000, 43 (03) :187-250

[3]

Hajek P., 1998, TRENDS LOGIC

[4] THEORY OF GENERALIZED ANNOTATED LOGIC PROGRAMMING AND ITS APPLICATIONS [J].

KIFER, M ;

SUBRAHMANIAN, VS .

JOURNAL OF LOGIC PROGRAMMING, 1992, 12 (04) :335-367

[5]

MEDINA J, UNPUB PROCEDURAL SEM

[6]

MEDINA J, 2001, LECT NOTES ARTIF INT, V2173, P341

[7]

NAITO E, 1995, FUZZINESS DATABASE M, P345

[8] SEMANTICS OF PREDICATE LOGIC AS A PROGRAMMING LANGUAGE [J].

VANEMDEN, MH ;

KOWALSKI, RA .

JOURNAL OF THE ACM, 1976, 23 (04) :733-742

[9]

VOJTAS P, 2001, IN PRESS FUZZY SETS

← 1 →