a2 Department of Applied Mathematics and Computer Science, Universiteit Gent Krijgslaan 281, 9000 Ghent, Belgium (e-mail: email@example.com)
a3 Institute of Technology, University of Washington 1900 Commerce Street, Tacoma, WA 98402, USA (e-mail: firstname.lastname@example.org)
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.
(Received August 16 2010)
(Revised January 17 2011)
(Accepted March 26 2011)
(Online publication June 21 2011)
* Funded by a joint Research Foundation-Flanders (FWO) project.
† Postdoctoral fellow of the Research Foundation-Flanders (FWO).
‡ On leave of absence from Ghent University.