http://www.cnr.it/ontology/cnr/individuo/prodotto/ID44256
Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Articolo in rivista)
- Type
- Label
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Articolo in rivista) (literal)
- Anno
- 2009-01-01T00:00:00+01:00 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
- 10.1007/s10472-008-9099-0 (literal)
- Alternative label
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- Loyer Y.; Straccia U. (literal)
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
- http://link.springer.com/article/10.1007%2Fs10472-008-9099-0 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
- Rivista
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
- In: Annals of Mathematics and Artificial Intelligence, vol. 55 (3-4) pp. 389 - 417. Springer Verlag, 2009. (literal)
- Note
- ISI Web of Science (WOS) (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
- PRISM, University of Paris, CNR-ISTI, Pisa (literal)
- Titolo
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (literal)
- Abstract
- The management of imprecise information in logic programs becomes important whenever the real world information to be represented is of an imperfect nature and the classical crisp \"true, false\" approximation is not adequate. In this work, we consider normal logic programs over complete lattices, where computable truth combination functions may appear in the rule bodies to manipulate truth values and we will provide a top-down query answering procedure. (literal)
- Prodotto di
- Autore CNR
- Insieme di parole chiave
Incoming links:
- Autore CNR di
- Prodotto
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
- Insieme di parole chiave di