Zobrazeno 1 - 10
of 166
pro vyhledávání: '"Bogaerts, Bart"'
Approximation Fixpoint Theory (AFT) is an algebraic framework designed to study the semantics of non-monotonic logics. Despite its success, AFT is not readily applicable to higher-order definitions. To solve such an issue, we devise a formal mathemat
Externí odkaz:
http://arxiv.org/abs/2408.11712
Autor:
Bogaerts, Bart, Charalambidis, Angelos, Chatziagapis, Giannos, Kostopoulos, Babis, Pollaci, Samuele, Rondogiannis, Panos
We propose a stable model semantics for higher-order logic programs. Our semantics is developed using Approximation Fixpoint Theory (AFT), a powerful formalism that has successfully been used to give meaning to diverse non-monotonic formalisms. The p
Externí odkaz:
http://arxiv.org/abs/2408.10563
Autor:
Carbonnelle, Pierre, Schenner, Gottfried, Bruynooghe, Maurice, Bogaerts, Bart, Denecker, Marc
We analyze how symmetries can be used to compress structures (also known as interpretations) onto a smaller domain without loss of information. This analysis suggests the possibility to solve satisfiability problems in the compressed domain for bette
Externí odkaz:
http://arxiv.org/abs/2311.03424
In this paper we define and study a multi-agent extension of autoepistemic logic (AEL) called distributed autoepistemic logic (dAEL). We define the semantics of dAEL using approximation fixpoint theory, an abstract algebraic framework that unifies di
Externí odkaz:
http://arxiv.org/abs/2306.02774
Common knowledge and only knowing capture two intuitive and natural notions that have proven to be useful in a variety of settings, for example to reason about coordination or agreement between agents, or to analyse the knowledge of knowledge-based a
Externí odkaz:
http://arxiv.org/abs/2306.03267
Many practical problems can be understood as the search for a state of affairs that extends a fixed partial state of affairs, the \emph{environment}, while satisfying certain conditions that are formally specified. Such problems are found in, e.g., e
Externí odkaz:
http://arxiv.org/abs/2305.17140
Autor:
Heyninck, Jesse, Bogaerts, Bart
Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of non-monotonic logics. In recent work, AFT was generalized to non-deterministic operators, i.e.\ operators whose range are sets of element
Externí odkaz:
http://arxiv.org/abs/2305.10846
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 3 (September 4, 2024) lmcs:11328
We investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they are generated by a finite set of operations. We obtain several positiv
Externí odkaz:
http://arxiv.org/abs/2305.04656
We build on a recently proposed method for stepwise explaining solutions of Constraint Satisfaction Problems (CSP) in a human-understandable way. An explanation here is a sequence of simple inference steps where simplicity is quantified using a cost
Externí odkaz:
http://arxiv.org/abs/2303.11712