2014
DOI: 10.1007/978-3-319-08644-6_7
|View full text |Cite
|
Sign up to set email alerts
|

Fuzzy Sets for a Declarative Description of Multi-adjoint Logic Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…On the other hand, in [11,10,22] we provided some advances in the design of declarative semantics and/or correctness properties regarding the development of fuzzy logic languages dealing with similarity/proximity relations (Bousi∼Prolog) or highly expressive lattices modeling truth degrees (MALP). As a matter of future work we want to establish that analogous -but reinforced-formal properties also hold in the language FASILL.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…On the other hand, in [11,10,22] we provided some advances in the design of declarative semantics and/or correctness properties regarding the development of fuzzy logic languages dealing with similarity/proximity relations (Bousi∼Prolog) or highly expressive lattices modeling truth degrees (MALP). As a matter of future work we want to establish that analogous -but reinforced-formal properties also hold in the language FASILL.…”
Section: Discussionmentioning
confidence: 99%
“…3 Operational Semantics of FASILL Rules in a FASILL program have the same role than clauses in PROLOG (or MALP [19,10,22]) programs, that is, stating that a certain predicate relates some terms (the head) if some conditions (the body) hold. As a logic language, FASILL inherits the concepts of substitution, unifier and most general unifier (mgu).…”
Section: Definition 24 (Program) a Program P Is A Tuple π R L Whementioning
confidence: 99%