TY - JOUR UR - http://lib.ugent.be/catalog/pug01:1938048 ID - pug01:1938048 LA - eng TI - Reducing fuzzy answer set programming to model finding in fuzzy logics PY - 2012 JO - (2012) THEORY AND PRACTICE OF LOGIC PROGRAMMING SN - 1471-0684 PB - 2012 AU - Janssen, Jeroen UGent 002003066467 AU - Schockaert, Steven WE02 801001865083 002000216889 AU - Vermeir, Dirk AU - De Cock, Martine WE02 801001237617 0000-0001-7917-0771 AB - In recent years, answer set programming (ASP) has been extended to deal with multivalued predicates. The resulting formalisms allow for the modeling of continuous problems as elegantly as ASP allows for the modeling of discrete problems, by combining the stable model semantics underlying ASP with fuzzy logics. However, contrary to the case of classical ASP where many efficient solvers have been constructed, to date there is no efficient fuzzy ASP solver. A well-known technique for classical ASP consists of translating an ASP program P to a propositional theory whose models exactly correspond to the answer sets of P. In this paper, we show how this idea can be extended to fuzzy ASP, paving the way to implement efficient fuzzy ASP solvers that can take advantage of existing fuzzy logic reasoners. ER -Download RIS file
00000nam^a2200301^i^4500 | |||
001 | 1938048 | ||
005 | 20180813141223.0 | ||
008 | 111028s2012------------------------eng-- | ||
022 | a 1471-0684 | ||
024 | a 000310854200001 2 wos | ||
024 | a 1854/LU-1938048 2 handle | ||
024 | a 10.1017/S1471068411000093 2 doi | ||
040 | a UGent | ||
245 | a Reducing fuzzy answer set programming to model finding in fuzzy logics | ||
260 | c 2012 | ||
520 | a In recent years, answer set programming (ASP) has been extended to deal with multivalued predicates. The resulting formalisms allow for the modeling of continuous problems as elegantly as ASP allows for the modeling of discrete problems, by combining the stable model semantics underlying ASP with fuzzy logics. However, contrary to the case of classical ASP where many efficient solvers have been constructed, to date there is no efficient fuzzy ASP solver. A well-known technique for classical ASP consists of translating an ASP program P to a propositional theory whose models exactly correspond to the answer sets of P. In this paper, we show how this idea can be extended to fuzzy ASP, paving the way to implement efficient fuzzy ASP solvers that can take advantage of existing fuzzy logic reasoners. | ||
598 | a A1 | ||
100 | a Janssen, Jeroen u UGent 0 002003066467 0 871008711349 | ||
700 | a Schockaert, Steven u WE02 0 801001865083 0 002000216889 0 052354806167 | ||
700 | a Vermeir, Dirk | ||
700 | a De Cock, Martine u WE02 0 801001237617 0 0000-0001-7917-0771 | ||
650 | a Science General | ||
653 | a answer set programming | ||
653 | a fuzzy logic | ||
653 | a ASSAT | ||
653 | a DEDUCTIVE DATABASES | ||
653 | a EPISTEMIC FOUNDATION | ||
653 | a SEMANTIC WEB | ||
653 | a SAT SOLVERS | ||
653 | a UNCERTAINTY | ||
653 | a VAGUENESS | ||
653 | a RETRIEVAL | ||
773 | t THEORY AND PRACTICE OF LOGIC PROGRAMMING g Theory Pract. Log. Program. 2012. 12 p.811-842 q 12:<811 | ||
856 | 3 Full Text u https://biblio.ugent.be/publication/1938048/file/1939152 z [open] y Janssen_TPLP_ip.pdf | ||
920 | a article | ||
852 | x WE b WE02 | ||
922 | a UGENT-WE |
All data below are available with an Open Data Commons Open Database License. You are free to copy, distribute and use the database; to produce works from the database; to modify, transform and build upon the database. As long as you attribute the data sets to the source, publish your adapted database with ODbL license, and keep the dataset open (don't use technical measures such as DRM to restrict access to the database).
The datasets are also available as weekly exports.