Reducing fuzzy answer set programming to model finding in fuzzy logics

Janssen, Jeroen, Vermeir, Dirk, Schockaert, Steven ORCID: https://orcid.org/0000-0002-9256-2881 and De Cock, Martine 2012. Reducing fuzzy answer set programming to model finding in fuzzy logics. Theory and Practice of Logic Programming 12 (6) , pp. 811-842. 10.1017/S1471068411000093

Full text not available from this repository.

Abstract

In recent years, answer set programming (ASP) has been extended to deal with multivalued predicates. The resulting formalismsallow for the modeling of continuous problems as elegantly as ASP allows for the modeling of discrete problems, by combining thestable model semantics underlying ASP with fuzzy logics. However, contrary to the case of classical ASP where manyefficient solvers have been constructed, to date there is no efficient fuzzy ASP solver. A well-knowntechnique for classical ASP consists of translating an ASP program P to a propositional theory whose models exactlycorrespond to the answer sets of P. In this paper, we show how this idea can be extended to fuzzy ASP, paving the wayto implement efficient fuzzy ASP solvers that can take advantage of existing fuzzy logic reasoners.

Item Type:	Article
Status:	Published
Schools:	Computer Science & Informatics
ISSN:	1471-0684
Last Modified:	25 Oct 2022 09:42
URI:	https://orca.cardiff.ac.uk/id/eprint/59684

Citation Data

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

Actions (repository staff only)

Edit Item