Paper Info
Title
Reducing fuzzy answer set programming to model finding in fuzzy logics
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.
Year
DOI
Venue
2011
10.1017/S1471068411000093
Theory and Practice of Logic Programming
Keywords
DocType
Volume
fuzzy logic,efficient fuzzy asp solvers,manyefficient solvers,answer set,efficient fuzzy asp solver,classical asp,fuzzy asp,continuous problem,fuzzy answer set programming,fuzzy logic reasoner,asp program p,answer set programming,programming language,stable model semantics
Journal
12
Issue
ISSN
Citations 
6
1471-0684
6
PageRank 
References 
Authors
0.43
40
4
Name
Order
Citations
PageRank
Jeroen Janssen1716.17
Dirk Vermeir269485.34
Steven Schockaert358357.95
Martine De Cock4134196.06