7 citations · 15 across the 9 of their papers we have counts for
7 papers · 1 filter
The Stable Model Semantics for Higher-Order Logic Programming
Bart Bogaerts, Angelos Charalambidis, Giannos Chatziagapis +3
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 successfull…
A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory
Samuele Pollaci, Babis Kostopoulos, Marc Denecker +1
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-…
Using Symmetries to Lift Satisfiability Checking
Pierre Carbonnelle, Gottfried Schenner, Maurice Bruynooghe +2
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 possibili…
Inputs, Outputs, and Composition in the Logic of Information Flows
Heba Aamer, Bart Bogaerts, Dimitri Surinx +2
The logic of information flows (LIF) is a general framework in which tasks of a procedural nature can be modeled in a declarative, logic-based fashion. The first contribution of th…
Proceedings 37th International Conference on Logic Programming (Technical Communications)
Andrea Formisano, Yanhong Annie Liu, Bart Bogaerts +7
ICLP is the premier international event for presenting research in logic programming. Contributions to ICLP 2021 were sought in all areas of logic programming, including but not li…
LP2PB: Translating Answer Set Programs into Pseudo-Boolean Theories
Wolf De Wulf, Bart Bogaerts
Answer set programming (ASP) is a well-established knowledge representation formalism. Most ASP solvers are based on (extensions of) technology from Boolean satisfiability solving.…