Zobrazeno 1 - 10
of 114
pro vyhledávání: '"MARC DENECKER"'
Publikováno v:
Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems ISBN: 9783031314759
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc37c68250e86ce11d3a55ece5793090
https://doi.org/10.1007/978-3-031-31476-6_9
https://doi.org/10.1007/978-3-031-31476-6_9
Aggregates provide a concise way to express complex knowledge. The problem of selecting an appropriate formalisation of aggregates for answer set programming (ASP) remains unsettled. This paper revisits it from the viewpoint of Approximation Fixpoint
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78a4ba14d81eb50907846d8550e34bd6
https://lirias.kuleuven.be/handle/20.500.12942/703450
https://lirias.kuleuven.be/handle/20.500.12942/703450
Publikováno v:
Theory and Practice of Logic Programming. 20:880-894
Justification theory is a unifying semantic framework. While it has its roots in non-monotonic logics, it can be applied to various areas in computer science, especially in explainable reasoning; its most central concept is a justification: an explan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1061baf7724777dab183c9d824446054
https://doi.org/10.1017/s1471068420000186
https://doi.org/10.1017/s1471068420000186
Publikováno v:
IJCAI
Approximation Fixpoint Theory (AFT) and Justification Theory (JT) are two frameworks to unify logical formalisms. AFT studies semantics in terms of fixpoints of lattice operators, and JT in terms of so-called justifications, which are explanations of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5e018ad486f4bf0bfbcd3d50b35ed74
https://doi.org/10.24963/ijcai.2021/272
https://doi.org/10.24963/ijcai.2021/272
Publikováno v:
Vrije Universiteit Brussel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f77906fd34d1426e334955320baae95e
https://biblio.vub.ac.be/vubir/interactive-advisor-for-lax-legislation-and-observable-situations(c899583d-a903-4e9c-b961-f84122c92873).html
https://biblio.vub.ac.be/vubir/interactive-advisor-for-lax-legislation-and-observable-situations(c899583d-a903-4e9c-b961-f84122c92873).html
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030393212
VMCAI
VMCAI
Parity games are infinite two-player games played on node-weighted directed graphs. Formal verification problems such as verifying and synthesizing automata, bounded model checking of LTL, CTL*, propositional µ-calculus, ...reduce to problems over p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70344d10c1dc92e0b36ebdb9e1e33e86
https://doi.org/10.1007/978-3-030-39322-9_21
https://doi.org/10.1007/978-3-030-39322-9_21
Many problems, especially those with a composite structure, can naturally be expressed in higher order logic. From a KR perspective modeling these problems in an intuitive way is a challenging task. In this paper we study the graph mining problem as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b759caef8d16ab4d6968ff0989635d11
https://lirias.kuleuven.be/handle/123456789/635313
https://lirias.kuleuven.be/handle/123456789/635313
Publikováno v:
Logics in Artificial Intelligence ISBN: 9783030195694
JELIA
JELIA
We point to several kinds of knowledge that play an important role in controversial examples of actual causation. One is nowledge about the causal mechanisms in the domain and the causal processes that result from them. Another is knowledge of what c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66db016c39cf08c942bcc28cac2a2237
https://lirias.kuleuven.be/handle/123456789/635312
https://lirias.kuleuven.be/handle/123456789/635312
Autor:
Ingmar Dasseville, Marc Denecker
Publikováno v:
Functional and Constraint Logic Programming ISBN: 9783030162016
WFLP
WFLP
Programming Computable Functions (PCF) is a simplified programming language which provides the theoretical basis of modern functional programming languages. Answer set programming (ASP) is a programming paradigm focused on solving search problems. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::513b658f2baf31e58d4b7aade9d44ced
https://doi.org/10.1007/978-3-030-16202-3_1
https://doi.org/10.1007/978-3-030-16202-3_1
Publikováno v:
AI Magazine; Vol 37, No 3: Fall 2016; 69-80
In Answer Set Programming (ASP), programs can be viewed as specifications of finite Herbrand structures. Other logics can be (and, in fact, were) used towards the same end and can be taken as the basis of declarative programming systems of similar fu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::594958a7bed66718da67cce63b6839e6
https://doi.org/10.1609/aimag.v37i3.2679
https://doi.org/10.1609/aimag.v37i3.2679