Computing Fuzzy Answer Sets Using dlvhex

Nieuwenborgh, Davy Van; Cock, Martine De; Vermeir, Dirk

doi:10.1007/978-3-540-74610-2_40

Cited by 9 publications

(12 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We furthermore show that the FASP semantics in terms of unfounded sets (Van Nieuwenborgh et al 2007a) coincide with the FASP semantics in terms of fixpoints (see e.g. (Lukasiewicz 2006)).…”

Section: Introductionmentioning

confidence: 62%

“…For solving continuous problems, however, we need infinite truth values, for which a solving method is much harder to construct. Our method is able to handle continuous problems, and additionally is more flexible than (Van Nieuwenborgh et al 2007a) since any method for solving continuous problems can be used as the backend, including fuzzy SAT solvers and the vast body of existing MIP solvers.…”

Section: Related Workmentioning

confidence: 99%

“…Likewise, possibilistic ASP can be reduced to classical ASP (Nicolas et al 2006), which means ASP solvers can be used for solving possibilistic ASP programs. In the case of fuzzy ASP programs with a finite number of truth values, it has been shown in (Van Nieuwenborgh et al 2007a) that FASP can be solved using regular ASP solvers. Unfortunately, to date, no fuzzy ASP solvers or solving methods have been constructed for programs with infinitely many truth values.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Reducing fuzzy answer set programming to model finding in fuzzy logics

Janssen¹,

Vermeir²,

Schockaert³

et al. 2011

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

In recent years answer set programming has been extended to deal with multi-valued 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 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 well-known technique for classical ASP consists of translating an ASP program P to a propositional theory whose models exactly correspond to the answer sets of P . In this paper, we show how this idea can be extended to fuzzy ASP, paving the way to implement efficient fuzzy ASP solvers that can take advantage of existing fuzzy logic reasoners.

show abstract

“…We furthermore show that the FASP semantics in terms of unfounded sets (Van Nieuwenborgh et al 2007a) coincide with the FASP semantics in terms of fixpoints (see e.g. (Lukasiewicz 2006)).…”

Section: Introductionmentioning

confidence: 62%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Reducing fuzzy answer set programming to model finding in fuzzy logics

Janssen¹,

Vermeir²,

Schockaert³

et al. 2011

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…The corresponding prototype implementation of such kind of system is given by mapping the default rules to a HEX-program. Fuzzy extensions of answer-set programs in relation with HEX-programs are given in [33,27]. While [33] maps fuzzy answer set programs to HEX-programs, [27] defines a fuzzy semantics for HEX-programs and gives a translation to standard HEX-programs.…”

Section: Implementation and Applicationsmentioning

confidence: 99%

“…Fuzzy extensions of answer-set programs in relation with HEX-programs are given in [33,27]. While [33] maps fuzzy answer set programs to HEX-programs, [27] defines a fuzzy semantics for HEX-programs and gives a translation to standard HEX-programs. In [34], the planning language K c was introduced which features external function calls in spirit of HEX-programs.…”

Section: Implementation and Applicationsmentioning

confidence: 99%

Combining Nonmonotonic Knowledge Bases with External Sources

Eiter

Brewka

Dao-Tran

et al. 2009

Frontiers of Combining Systems

View full text Add to dashboard Cite

Abstract. The developments in information technology during the last decade have been rapidly changing the possibilities for data and knowledge access. To respect this, several declarative knowledge representation formalisms have been extended with the capability to access data and knowledge sources that are external to a knowledge base. This article reviews some of these formalisms that are centered around Answer Set Programming, viz. HEX-programs, modular logic programs, and multi-context systems, which were developed by the KBS group of the Vienna University of Technology in cooperation with external colleagues. These formalisms were designed with different principles and four different settings, and thus have different properties and features; however, as argued, they are not unrelated. Furthermore, they provide a basis for advanced knowledge-based information systems, which are targeted in ongoing research projects.

show abstract