Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Dirk Vermeir"'
Publikováno v:
FUZZY SETS AND SYSTEMS
Autoepistemic logic is an important formalism for nonmonotonic reasoning. It extends propositional logic by offering the ability to reason about an agent's (lack of) beliefs. Moreover, it is well known to generalize the stable model semantics of answ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7598e8cf40e947a544fd6315bec2130
https://doi.org/10.1016/j.fss.2012.09.012
https://doi.org/10.1016/j.fss.2012.09.012
Publikováno v:
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING
Although Answer Set Programming (ASP) is a powerful framework for declarative problem solving, it cannot in an intuitive way handle situations in which some rules are uncertain, or in which it is more important to satisfy some constraints than others
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0d9d296a4a48fa94c88630bdb91564b6
https://doi.org/10.1016/j.ijar.2013.09.006
https://doi.org/10.1016/j.ijar.2013.09.006
Publikováno v:
ACM Transactions on Computational Logic. 13:1-39
In this article, we introduce fuzzy equilibrium logic as a generalization of both Pearce equilibrium logic and fuzzy answer set programming. The resulting framework combines the capability of equilibrium logic to declaratively specify search problems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf26cf86852e11455e51bad045a26ae6
https://doi.org/10.1145/2362355.2362361
https://doi.org/10.1145/2362355.2362361
Publikováno v:
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING
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 paper we investigate the expressivity of these frameworks. Specifically we sh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73d5c9553b48364f857d91b50cbcd6cc
https://doi.org/10.1016/j.ijar.2012.01.005
https://doi.org/10.1016/j.ijar.2012.01.005
Publikováno v:
ACM Transactions on Computational Logic. 9:1-53
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program's constants. We define a fixed point logic (FPL) extension of Clark's completion such that open answ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3cac3486009fc4d6ddf71ee0df05a4d4
https://doi.org/10.1145/1380572.1380575
https://doi.org/10.1145/1380572.1380575
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 50:363-388
In this paper we show how the concepts of answer set programming and fuzzy logic can be successfully combined into the single framework of fuzzy answer set programming (FASP). The framework offers the best of both worlds: from the answer set semantic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1eeb6e0e0f6ff38279dedaae700749ca
https://doi.org/10.1007/s10472-007-9080-3
https://doi.org/10.1007/s10472-007-9080-3
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 47:103-137
Open answer set programming (OASP) solves the lack of modularity in closed world answer set programming by allowing for the grounding of logic programs with an arbitrary non-empty countable superset of the program's constants. However, OASP is, in ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7917adda6fc21bb7f262071e78041190
https://doi.org/10.1007/s10472-006-9030-5
https://doi.org/10.1007/s10472-006-9030-5
Publikováno v:
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING
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 a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03490d052a2e815ba2687a09a214aa3e
https://biblio.ugent.be/publication/4221559
https://biblio.ugent.be/publication/4221559
Autor:
Dirk Vermeir, Marina De Vos
Publikováno v:
Computational Intelligence. 17:651-684
We propose a semantics for disjunctive logic programs, based on the single notion of forcing. We show that the semantics properly extends, in a natural way, previous approaches. A fixpoint characterization is also provided. We also take a closer look
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab54159ac7297736c60e2505ccb76c03
https://doi.org/10.1111/0824-7935.00168
https://doi.org/10.1111/0824-7935.00168
Autor:
Dirk Vermeir, Hadassa Jakobovits
Publikováno v:
Journal of Logic and Computation. 9:215-261
We suggest a so-called `robust' semantics for a model of argumentation which represents arguments and their interactions, called `argumentation frameworks'. We study a variety of additional definitions of acceptability of arguments; we explore the pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9edd983b2ddf86c6e8a14a90408744a8
https://doi.org/10.1093/logcom/9.2.215
https://doi.org/10.1093/logcom/9.2.215