Document - Approximate well-founded semantics, query answering and generalized normal logic programs over lattices

2009

Journal article Open Access

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices

Loyer Y., Straccia U.

Uncertainty Artificial Intelligence Logic Programming Applied Mathematics [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB] I.2.4 Knowledge Representation Formalisms and Methods

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.

Source: Annals of mathematics and artificial intelligence 55 (2009): 389–417. doi:10.1007/s10472-008-9099-0

Publisher: J.C. Baltzer AG., Basel, Svizzera

Metrics

Back to previous page

Cite as

BibTeX entry

@article{oai:it.cnr:prodotti:44256,
	title = {Approximate well-founded semantics, query answering and generalized normal logic programs over lattices},
	author = {Loyer Y. and Straccia U.},
	publisher = {J.C. Baltzer AG., Basel, Svizzera},
	doi = {10.1007/s10472-008-9099-0},
	journal = {Annals of mathematics and artificial intelligence},
	volume = {55},
	pages = {389–417},
	year = {2009}
}