Advanced search
1 file | 245.50 KB

Solving disjunctive fuzzy answer set programs

Author
Organization
Project
Bioinformatics: from nucleotids to networks (N2N)
Abstract
Fuzzy Answer Set Programming (FASP) is an extension of the popular Answer Set Programming (ASP) paradigm which is tailored for continuous domains. Despite the existence of several prototype implementations, none of the existing solvers can handle disjunctive rules in a sound and efficient manner. We first show that a large class of disjunctive FASP programs called the self-reinforcing cycle-free (SRCF) programs can be polynomially reduced to normal FASP programs. We then introduce a general method for solving disjunctive FASP programs, which combines the proposed reduction with the use of mixed integer programming for minimality checking. We also report the result of the experimental benchmark of this method.
Keywords
logic programming, multi-valued logic, Fuzzy answer set programming, solver

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 245.50 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Mushthofa, Mushthofa, Steven Schockaert, and Martine De Cock. 2015. “Solving Disjunctive Fuzzy Answer Set Programs.” In Lecture Notes in Computer Science, ed. Francesco Calimeri, Giovambattista Ianni, and Miroslaw Truszczynski, 9345:453–466. Cham, Switzerland: Springer.
APA
Mushthofa, M., Schockaert, S., & De Cock, M. (2015). Solving disjunctive fuzzy answer set programs. In F. Calimeri, G. Ianni, & M. Truszczynski (Eds.), Lecture Notes in Computer Science (Vol. 9345, pp. 453–466). Presented at the 13th International conference of Logic Programming and Nonmonotonic Reasoning (LPNMR 2015), Cham, Switzerland: Springer.
Vancouver
1.
Mushthofa M, Schockaert S, De Cock M. Solving disjunctive fuzzy answer set programs. In: Calimeri F, Ianni G, Truszczynski M, editors. Lecture Notes in Computer Science. Cham, Switzerland: Springer; 2015. p. 453–66.
MLA
Mushthofa, Mushthofa, Steven Schockaert, and Martine De Cock. “Solving Disjunctive Fuzzy Answer Set Programs.” Lecture Notes in Computer Science. Ed. Francesco Calimeri, Giovambattista Ianni, & Miroslaw Truszczynski. Vol. 9345. Cham, Switzerland: Springer, 2015. 453–466. Print.
@inproceedings{7053048,
  abstract     = {Fuzzy Answer Set Programming (FASP) is an extension of the popular Answer Set Programming (ASP) paradigm which is tailored for continuous domains. Despite the existence of several prototype implementations, none of the existing solvers can handle disjunctive rules in a sound and efficient manner. We first show that a large class of disjunctive FASP programs called the self-reinforcing cycle-free (SRCF) programs can be polynomially reduced to normal FASP programs. We then introduce a general method for solving disjunctive FASP programs, which combines the proposed reduction with the use of mixed integer programming for minimality checking. We also report the result of the experimental benchmark of this method.},
  author       = {Mushthofa, Mushthofa and Schockaert, Steven and De Cock, Martine},
  booktitle    = {Lecture Notes in Computer Science},
  editor       = {Calimeri, Francesco and Ianni, Giovambattista and Truszczynski, Miroslaw},
  isbn         = {9783319232645},
  issn         = {0302-9743},
  keyword      = {logic programming,multi-valued logic,Fuzzy answer set programming,solver},
  language     = {eng},
  location     = {Lexington, KY, USA},
  pages        = {453--466},
  publisher    = {Springer},
  title        = {Solving disjunctive fuzzy answer set programs},
  url          = {http://dx.doi.org/10.1007/978-3-319-23264-5\_38},
  volume       = {9345},
  year         = {2015},
}

Altmetric
View in Altmetric