Skip to main content
    • Aa
    • Aa

Fuzzy answer sets approximations


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.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

C. Baral 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.

F. Calimeri , G. Ianni , F. Ricca , M. Alviano , A. Bria , G. Catalano , S. Cozza , W. Faber , O. Febbraro , N. Leone , M. Manna , A. Martello , C. Panetta , S. Perri , K. Reale , M. C. Santoro , M. Sirianni , G. Terracina and P. Veltri 2011. The third answer set programming competition: Preliminary report of the system competition track. In 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2011), J. Delgrande and W. Faber , Eds. Lecture Notes in Computer Science, vol. 6645, SpringerBerlin/Heidelberg, 388403.

D. Dubois , J. Lang and H. Prade 1991. Fuzzy sets in approximate reasoning, part 2: Logical approaches. Fuzzy Sets and Systems 40, 1, 203244.

M. Gelfond and V. Lifschitz 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365385.

E. P. Klement , R. Mesiar and E. Pap 2000. Triangular Norms. Trends in Logic, Studia Logica Library. Springer-Verlag.

V. Lifschitz 2002. Answer set programming and plan generation. Artificial Intelligence 138, 3954.

F. Lin and J.-H. You 2002. Abduction in logic programming: A new definition and an abductive procedure based on rewriting. Artificial Intelligence 140, 1/2, 175205.

Y. Loyer and U. Straccia 2009. Approximate well-founded semantics, query answering and generalized normal logic programs over lattices. Annals Mathematics and Artificial Intelligence 55, 3–4, 389417.

T. Lukasiewicz 2006. Fuzzy description logic programs under the answer set semantics for the semantic web. In Proc. 2nd International Conference on Rules and Rule Markup Languages for the Semantic Web (RuleML 2006), T. Eiter , E. Franconi , R. Hodgson and S. Stephens , Eds. IEEE Computer Society, 8996.

V. W. Marek and M. Truszczyński 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm – A 25-Year Perspective, K. R. Apt , V. W. Marek , M. Truszczyński and D. S. Warren , Eds. Springer Verlag, 375398.

I. Niemelä 1999. Logic programming with stable model semantics as constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 3–4, 241273.

D. V. Nieuwenborgh , M. D. Cock and D. Vermeir 2007b. An introduction to fuzzy answer set programming. Annals Mathematics and Artificial Intelligence 50, 3–4, 363388.

P. Simons , I. Niemelä and T. Soininen 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138, 181234.

A. Van Gelder , K. A. Ross and J. S. Schlipf 1991. The Well-founded semantics for general logic programs. Journal of the ACM 38, 3, 620650.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Type Description Title
Supplementary Materials

Alviano et al. supplementary material

 PDF (260 KB)
260 KB


Full text views

Total number of HTML views: 0
Total number of PDF views: 6 *
Loading metrics...

Abstract views

Total abstract views: 159 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 24th June 2017. This data will be updated every 24 hours.