A completeness theorem for multi-adjoint logic programming

IEEE International Conference on Fuzzy Systems

Volumn 2, Issue , 2001, Pages 1031-1034

  Medina, Jesús ^a   Ojeda Aciego, Manuel ^a   Vojtáš, Peter ^b  

^a UNIVERSITY OF MÁLAGA   (Spain)

^b P J AFÁRIK UNIVERSITY   (Slovakia)

Author keywords

Approximate reasoning; Completeness results; Continuous fix point semantics; Fuzzy logic programming

Indexed keywords

APPROXIMATE REASONING; MULTI-ADJOINT LOGIC PROGRAMMING;

FUZZY SETS; MANY VALUED LOGICS; PROBABILITY; SEMANTICS;

LOGIC PROGRAMMING;

EID: 0036343570     PISSN: None     EISSN: None     Source Type: Journal    
DOI: 10.1109/FUZZ.2001.1009138     Document Type: Article

References (9)

1. Monotonic and residuated logic programs
2. Fuzzy logic programming
3. A proposal of a fuzzy connective with learning function
4. Hybrid probabilistic programs
5. Multi-adjoint logic programming with continuous semantics
6. Metamathematics of Fuzzy Logic
7. A procedural semantics for multi-adjoint logic programming
8. The semantics of predicate logic as a programming language
9. Theory of generalized annotated logic programming and its applications