Fuzzy answer set programming

Authors:
Davy Van Nieuwenborgh;Martine De Cock;Dirk Vermeir
Affiliations:
Dept. of Computer Science, Vrije Universiteit Brussel, VUB, Brussels, Belgium;Dept. of Applied Mathematics and Computer Science, Universiteit Gent, UGent, Ghent, Belgium;Dept. of Computer Science, Vrije Universiteit Brussel, VUB, Brussels, Belgium
Venue:
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Year:
2006

Citing 12
Cited 1

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Preferred answer sets for extended logic programs

Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Developing a Declarative Rule Language for Applications in Product Configuration

PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
An A-Prolog Decision Support System for the Space Shuttle

PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Strong and Weak Constraints in Disjunctive Datalog

LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Extending Disjunctive Logic Programming by T-norms

LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
On the Role of Negation in Choice Logic Programs

LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Logic programming with ordered disjunction

Eighteenth national conference on Artificial intelligence
Preferred answer sets for ordered logic programs

Theory and Practice of Logic Programming
The Diagnosis Frontend of the dlv system

AI Communications
Possibilistic stable models

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Semantics for possibilistic answer set programs: Uncertain rules versus rules with uncertain conclusions

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we show how the concepts of answer set programming and fuzzy logic can be succesfully combined into the single framework of fuzzy answer set programming (FASP). The framework offers the best of both worlds: from the answer set semantics, it inherits the truly declarative non-monotonic reasoning capabilities while, on the other hand, the notions from fuzzy logic in the framework allow it to step away from the sharp principles used in classical logic, e.g., that something is either completely true or completely false. As fuzzy logic gives the user great flexibility regarding the choice for the interpretation of the notions of negation, conjunction, disjunction and implication, the FASP framework is highly configurable and can, e.g., be tailored to any specific area of application. Finally, the presented framework turns out to be a proper extension of classical answer set programming, as we show, in contrast to other proposals in the literature, that there are only minor restrictions one has to demand on the fuzzy operations used, in order to be able to retrieve the classical semantics using FASP.