Results 1  10
of
38
Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
"... Abstract. We show how a fuzzy answer set program can be compiled to an equivalent fuzzy propositional theory whose models correspond to the answer sets of the program. This creates a basis for constructing fuzzy answer set solvers, such as solvers based on fuzzy SATsolvers or on linear programming. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. We show how a fuzzy answer set program can be compiled to an equivalent fuzzy propositional theory whose models correspond to the answer sets of the program. This creates a basis for constructing fuzzy answer set solvers, such as solvers based on fuzzy SATsolvers or on linear programming
Under consideration for publication in Theory and Practice of Logic Programming 1 Fuzzy Answer Sets Approximations
, 2013
"... 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 logi ..."
Abstract
 Add to MetaCart
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
Complexity of fuzzy answer set programming under Lukasiewicz
"... Fuzzy answer set programming (FASP) is a generalization of answer set programming (ASP) in which propositions are allowed to be graded. Little is known about the computational complexity of FASP and almost no techniques are available to compute the answer sets of a FASP program. In this paper, we ..."
Abstract
 Add to MetaCart
Fuzzy answer set programming (FASP) is a generalization of answer set programming (ASP) in which propositions are allowed to be graded. Little is known about the computational complexity of FASP and almost no techniques are available to compute the answer sets of a FASP program. In this paper, we
Towards Possibilistic Fuzzy Answer Set Programming
"... Fuzzy answer set programming (FASP) is a generalization of answer set programming to continuous domains. As it can not readily take uncertainty into account, however, FASP is not suitable as a basis for approximate reasoning and cannot easily be used to derive conclusions from imprecise information. ..."
Abstract
 Add to MetaCart
Fuzzy answer set programming (FASP) is a generalization of answer set programming to continuous domains. As it can not readily take uncertainty into account, however, FASP is not suitable as a basis for approximate reasoning and cannot easily be used to derive conclusions from imprecise information
Under consideration for publication in Theory and Practice of Logic Programming 1 Reducing Fuzzy Answer Set Programming to Model Finding in Fuzzy Logics
"... In recent years answer set programming has been extended to deal with multivalued predicates. The resulting formalisms allows for the modeling of continuous problems as elegantly as ASP allows for the modeling of discrete problems, by combining the stable model semantics underlying ASP with fuzzy l ..."
Abstract
 Add to MetaCart
logics. However, contrary to the case of classical ASP where many efficient solvers have been constructed, to date there is no efficient fuzzy answer set programming solver. A wellknown technique for classical ASP consists of translating an ASP program P to a propositional theory whose models exactly
1Measuring Inconsistency in Fuzzy Answer Set Semantics
"... Abstract—Recent approaches have shown that the measurement of the amount of inconsistent information contained in a logic theory can be useful to infer positive information. This paper deals with the definition of measures of inconsistency in the residuated logic programming paradigm under the fuz ..."
Abstract
 Add to MetaCart
the fuzzy answer set semantics. This fuzzy framework provides a soft mechanism of controlling the amount of information inferred and thus, controlling the inconsistencies by modifying slightly the truthvalues of some rules. Index Terms—Inconsistency, Fuzzy answer set semantics. I.
Cock. Complexity of fuzzy answer set programming under Łukasiewicz semantics
, 2013
"... 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 ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
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
Reasoning with Propositional Knowledge Based on Fuzzy Neural Logic
"... In this article, a new kind of reasoning for propositional knowledge, which is based on the fuzzy neural logic initialed by Teh, is introduced. A fundamental theorem is presented showing that any fuzzy neural logic network can be represented by operations: bounded sum, complement, and scalar produc ..."
Abstract
 Add to MetaCart
product. Propositional calculus of fuzzy neural logic is also investigated. Linear programming problems risen from the propositional calculus of fuzzy neural logic show a great advantage in applying fuzzy neural logic to answer imprecise questions in knowledgebased systems. An example is reconsidered
ANYTIME FUZZY CONTROLLER
, 2006
"... Fuzzy logic has been successfully applied in various fields. However, as fuzzy controllers increase in size and complexity, the number of control rules increases exponentially and realtime behavior becomes more difficult. This thesis introduces an anytime fuzzy controller. Much work has been done ..."
Abstract
 Add to MetaCart
Fuzzy logic has been successfully applied in various fields. However, as fuzzy controllers increase in size and complexity, the number of control rules increases exponentially and realtime behavior becomes more difficult. This thesis introduces an anytime fuzzy controller. Much work has been done
Hypersequents and the proof theory of intuitionistic fuzzy logic
 Computer Science Logic CSL’2000. Proceedings, LNCS 1862
, 2000
"... Abstract. Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the firstorder Gödel logic based on the truth value set [0,1]. The logic is known to be axiomatizable, but no deduction system amenable to prooftheoretic, and ..."
Abstract

Cited by 25 (9 self)
 Add to MetaCart
Abstract. Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the firstorder Gödel logic based on the truth value set [0,1]. The logic is known to be axiomatizable, but no deduction system amenable to prooftheoretic
Results 1  10
of
38