Fuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FASP solvers are available and all current proposals are based on compilations of logic programs into different paradigms, like mixed integer programs or bilevel programs. These approaches introduce many auxiliary variables which might affect the performance of a solver negatively. To limit this downside, operators for approximating fuzzy answer sets can be introduced: Given a FASP program, these operators compute lower and upper bounds for all atoms in the program such that all answer sets are between these bounds. This paper analyzes several operators of this kind which are based on linear programming, fuzzy unfounded sets and source pointers. Furthermore, the paper reports on a prototypical implementation, also describing strategies for avoiding computations of these operators when they are guaranteed to not improve current bounds. The operators and their implementation can be used to obtain more constrained mixed integer or bilevel programs, or even for providing a basis for implementing a native FASP solver. Interestingly, the semantics of relevant classes of programs with unique answer sets, like positive programs and programs with stratified negation, can be already computed by the prototype without the need for an external tool

Alviano, M., Peñaloza Nyssen, R. (2013). Fuzzy answer sets approximations. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 13(4-5), 753-767 [10.1017/S1471068413000471].

Fuzzy answer sets approximations

Peñaloza Nyssen, R
2013

Abstract

Fuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FASP solvers are available and all current proposals are based on compilations of logic programs into different paradigms, like mixed integer programs or bilevel programs. These approaches introduce many auxiliary variables which might affect the performance of a solver negatively. To limit this downside, operators for approximating fuzzy answer sets can be introduced: Given a FASP program, these operators compute lower and upper bounds for all atoms in the program such that all answer sets are between these bounds. This paper analyzes several operators of this kind which are based on linear programming, fuzzy unfounded sets and source pointers. Furthermore, the paper reports on a prototypical implementation, also describing strategies for avoiding computations of these operators when they are guaranteed to not improve current bounds. The operators and their implementation can be used to obtain more constrained mixed integer or bilevel programs, or even for providing a basis for implementing a native FASP solver. Interestingly, the semantics of relevant classes of programs with unique answer sets, like positive programs and programs with stratified negation, can be already computed by the prototype without the need for an external tool
Articolo in rivista - Articolo scientifico
fuzzy logic, answer set programming
English
2013
13
4-5
753
767
reserved
Alviano, M., Peñaloza Nyssen, R. (2013). Fuzzy answer sets approximations. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 13(4-5), 753-767 [10.1017/S1471068413000471].
File in questo prodotto:
File Dimensione Formato  
AlPe-TPLP13.pdf

Solo gestori archivio

Tipologia di allegato: Author’s Accepted Manuscript, AAM (Post-print)
Dimensione 433.43 kB
Formato Adobe PDF
433.43 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/258729
Citazioni
  • Scopus 15
  • ???jsp.display-item.citation.isi??? 8
Social impact