General fuzzy answer set programs

Janssen, Jeroen, Schockaert, Steven ORCID: https://orcid.org/0000-0002-9256-2881, Vermeir, Jerome and De Cock, Martine 2009. General fuzzy answer set programs. Lecture Notes in Computer Science 5571 , pp. 352-359. 10.1007/978-3-642-02282-1_44

Full text not available from this repository.

Abstract

A number of generalizations of answer set programming have been proposed in the literature to deal with vagueness, uncertainty, and partial rule satisfaction. We introduce a unifying framework that entails most of the existing approaches to fuzzy answer set programming. In this framework, rule bodies are defined using arbitrary fuzzy connectives with monotone partial mappings. As an approximation of full answer sets, k–answer sets are introduced to deal with conflicting information, yielding a flexible framework that encompasses, among others, existing work on valued constraint satisfaction and answer set optimization

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software
Additional Information:	Proceedings of the 8th International Workshop, WILF 2009 Palermo, Italy, June 9-12, 2009
Publisher:	Springer Verlag
ISBN:	9783642022814
ISSN:	0302-9743
Last Modified:	20 Oct 2022 09:24
URI:	https://orca.cardiff.ac.uk/id/eprint/31827

Citation Data

Cited 14 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item