Advanced search
1 file | 270.55 KB

Complexity of fuzzy answer set programming under Łukasiewicz semantics: first results

Author
Organization
Project
Bioinformatics: from nucleotids to networks (N2N)
Abstract
Fuzzy answer set programming (FASP) has recently been proposed as a generalization of answer set programming in which propositions are allowed to be graded. Little is known about its computational complexity. In this paper we present some results and reveal a connection to an open problem about integer equations, suggesting that characterizing the complexity of FASP may not be straightforward.

Downloads

  • Complexity FASP Blondeel final version.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 270.55 KB

Citation

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

Chicago
Blondeel, Marjon, Steven Schockaert, Martine De Cock, and Dirk Vermeir. 2011. “Complexity of Fuzzy Answer Set Programming Under Łukasiewicz Semantics: First Results.” In Poster Proceedings of the 5th International Conference on Scalable Uncertainty Management, 7–12.
APA
Blondeel, Marjon, Schockaert, S., De Cock, M., & Vermeir, D. (2011). Complexity of fuzzy answer set programming under Łukasiewicz semantics: first results. Poster proceedings of the 5th international conference on scalable uncertainty management (pp. 7–12). Presented at the 5th International conference on Scalable Uncertainty Management (SUM 2011).
Vancouver
1.
Blondeel M, Schockaert S, De Cock M, Vermeir D. Complexity of fuzzy answer set programming under Łukasiewicz semantics: first results. Poster proceedings of the 5th international conference on scalable uncertainty management. 2011. p. 7–12.
MLA
Blondeel, Marjon, Steven Schockaert, Martine De Cock, et al. “Complexity of Fuzzy Answer Set Programming Under Łukasiewicz Semantics: First Results.” Poster Proceedings of the 5th International Conference on Scalable Uncertainty Management. 2011. 7–12. Print.
@inproceedings{1987081,
  abstract     = {Fuzzy answer set programming (FASP) has recently been proposed as a generalization of answer set programming in which propositions are allowed to be graded. Little is known about its computational complexity. In this paper we present some results and reveal a connection to an open problem about integer equations, suggesting that characterizing the complexity of FASP may not be straightforward.},
  author       = {Blondeel, Marjon and Schockaert, Steven and De Cock, Martine and Vermeir, Dirk },
  booktitle    = {Poster proceedings of the 5th international conference on scalable uncertainty management},
  language     = {eng},
  location     = {Dayton, OH, USA},
  pages        = {7--12},
  title        = {Complexity of fuzzy answer set programming under \unmatched{0141}ukasiewicz semantics: first results},
  year         = {2011},
}