@article{1938048,
  abstract     = {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.},
  author       = {Janssen, Jeroen and Schockaert, Steven and Vermeir, Dirk and De Cock, Martine},
  issn         = {1471-0684},
  journal      = {THEORY AND PRACTICE OF LOGIC PROGRAMMING},
  keyword      = {answer set programming,fuzzy logic,ASSAT,DEDUCTIVE DATABASES,EPISTEMIC FOUNDATION,SEMANTIC WEB,SAT SOLVERS,UNCERTAINTY,VAGUENESS,RETRIEVAL},
  language     = {eng},
  pages        = {811--842},
  title        = {Reducing fuzzy answer set programming to model finding in fuzzy logics},
  url          = {http://dx.doi.org/10.1017/S1471068411000093},
  volume       = {12},
  year         = {2012},
}

Altmetric

View in Altmetric

Web of Science

Times cited: