Complexity of fuzzy answer set programming under Lukasiewicz semantics: First results

Marjon Blondeel; Steven Schockaert; Martine De Cock; Dirk Vermeir

Complexity of fuzzy answer set programming under Lukasiewicz semantics: First results

Marjon Blondeel, Steven Schockaert, Martine De Cock, Dirk Vermeir

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research

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.

Original language	English
Title of host publication	Scalable Uncertainty Management - 5th International Conference, SUM 2011, Dayton, OH, USA, October 10-13, 2011. Proceedings.
Pages	7-12
Number of pages	6
Publication status	Published - 10 Oct 2011
Event	Unknown - Duration: 10 Oct 2011 → …

Conference

Conference	Unknown
Period	10/10/11 → …

Keywords

Fuzzy Answer Set Programming
Lukasiewicz logic
Complexity

Cite this

@inproceedings{f6a11c8f25d94ed4a3dc064e3363a459,

title = "Complexity of fuzzy answer set programming under Lukasiewicz semantics: First results",

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.",

keywords = "Fuzzy Answer Set Programming, Lukasiewicz logic, Complexity",

author = "Marjon Blondeel and Steven Schockaert and {De Cock}, Martine and Dirk Vermeir",

year = "2011",

month = oct,

day = "10",

language = "English",

pages = "7--12",

booktitle = "Scalable Uncertainty Management - 5th International Conference, SUM 2011, Dayton, OH, USA, October 10-13, 2011. Proceedings.",

note = "null ; Conference date: 10-10-2011",

}

Complexity of fuzzy answer set programming under Lukasiewicz semantics: First results. / Blondeel, Marjon; Schockaert, Steven; De Cock, Martine; Vermeir, Dirk.

Scalable Uncertainty Management - 5th International Conference, SUM 2011, Dayton, OH, USA, October 10-13, 2011. Proceedings.. 2011. p. 7-12.

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research

TY - GEN

T1 - Complexity of fuzzy answer set programming under Lukasiewicz semantics: First results

AU - Blondeel, Marjon

AU - Schockaert, Steven

AU - De Cock, Martine

AU - Vermeir, Dirk

PY - 2011/10/10

Y1 - 2011/10/10

N2 - 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.

AB - 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.

KW - Fuzzy Answer Set Programming

KW - Lukasiewicz logic

KW - Complexity

M3 - Conference paper

SP - 7

EP - 12

BT - Scalable Uncertainty Management - 5th International Conference, SUM 2011, Dayton, OH, USA, October 10-13, 2011. Proceedings.

Y2 - 10 October 2011

ER -

Complexity of fuzzy answer set programming under Lukasiewicz semantics: First results

Abstract

Conference

Keywords

Fingerprint

Cite this