Name
Abstract | ||
|---|---|---|
The theory of multi-adjoint logic programs has been introduced as a unifying framework to deal with uncertainty, imprecise data or incomplete information. From the applicative part, a neural net based implementation of homogeneous propositional multi-adjoint logic programming on the unit interval has been presented elsewhere, but restricted to the case in which the only connectives involved in the program were the usual product, Godel and Lukasievicz together with weighted sums. A modification of the neural implementation is presented-here in order to deal with a more general family of adjoint pairs, including conjunctors constructed as an ordinal sum of a finite family of basic conjunctors. This enhancement a-ready expands the scope of the initial approach, since every t-norm (the type of conjunctor generally used in applications) can be expressed as an ordinal sum of product, Godel and Lukasiewicz conjunctors. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30498-2_72 | ADVANCES IN ARTIFICIAL INTELLIGENCE - IBERAMIA 2004 |
Keywords | Field | DocType |
neural net,sum of products | T-norm,Discrete mathematics,Gödel,Computer science,Ordinal number,Propositional calculus,Unit interval,Logic programming,Artificial neural network,Complete information | Conference |
Volume | ISSN | Citations |
3315 | 0302-9743 | 2 |
PageRank | References | Authors |
0.39 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jesús Medina | 1 | 933 | 70.56 |
| Enrique Mérida Casermeiro | 2 | 22 | 5.38 |
| Manuel Ojeda-aciego | 3 | 748 | 68.13 |