A finite-valued solver for disjunctive fuzzy answer set programs
Abstract Fuzzy Answer Set Programming (FASP) is a declarative programming paradigm
which extends the flexibility and expressiveness of classical Answer Set Programming …
which extends the flexibility and expressiveness of classical Answer Set Programming …
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 …
that enriches the declarativity of answer set programming by allowing propositions to be …
[HTML][HTML] Tabulation proof procedures for fuzzy linguistic logic programming
F Liu - International Journal of Approximate Reasoning, 2015 - Elsevier
Fuzzy linguistic logic programming is a logical system for representing and reasoning with
linguistically-expressed human knowledge. In fuzzy linguistic logic programming, up until …
linguistically-expressed human knowledge. In fuzzy linguistic logic programming, up until …
Fuzzy answer set computation via satisfiability modulo theories
Fuzzy answer set programming (FASP) combines two declarative frameworks, answer set
programming and fuzzy logic, in order to model reasoning by default over imprecise …
programming and fuzzy logic, in order to model reasoning by default over imprecise …
Minimal undefinedness for fuzzy answer sets
Abstract Fuzzy Answer Set Programming (FASP) combines the non-monotonic reasoning
typical of Answer Set Programming with the capability of Fuzzy Logic to deal with imprecise …
typical of Answer Set Programming with the capability of Fuzzy Logic to deal with imprecise …
A core language for fuzzy answer set programming
A number of different Fuzzy Answer Set Programming (FASP) formalisms have been
proposed in the last years, which all differ in the language extensions they support. In this …
proposed in the last years, which all differ in the language extensions they support. In this …
Solving satisfiability in fuzzy logics by mixing CMA-ES
Satisfiability in propositional logic is well researched and many approaches to checking and
solving exist. In infinite-valued or fuzzy logics, however, there have only recently been …
solving exist. In infinite-valued or fuzzy logics, however, there have only recently been …
Extending Fuzzy Linguistic Logic Programming with Negation
VH Le - Mathematics, 2022 - mdpi.com
Fuzzy linguistic logic programming (FLLP) is a framework for representation and reasoning
with linguistically expressed human knowledge. In this paper, we extend FLLP by allowing …
with linguistically expressed human knowledge. In this paper, we extend FLLP by allowing …
Stable models of fuzzy propositional formulas
We introduce the stable model semantics for fuzzy propositional formulas, which generalizes
both fuzzy propositional logic and the stable model semantics of Boolean propositional …
both fuzzy propositional logic and the stable model semantics of Boolean propositional …
Solving satisfiability in fuzzy logics with evolution strategies
Satisfiability in propositional logic is well researched and many approaches to checking and
solving exist. In infinite-valued or fuzzy logics, however, there have only recently been …
solving exist. In infinite-valued or fuzzy logics, however, there have only recently been …