User profiles for Samuele Pollaci
 | Samuele PollaciPh.D. Student in Computer Science, VUB Verified email at vub.be Cited by 5 |
The stable model semantics for higher-order logic programming
…, G Chatziagapis, B Kostopoulos, S Pollaci… - arXiv preprint arXiv …, 2024 - arxiv.org
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 …
developed using Approximation Fixpoint Theory (AFT), a powerful formalism that has …
Spurious valleys and clustering behavior of neural networks
S Pollaci - International Conference on Machine Learning, 2023 - proceedings.mlr.press
Neural networks constitute a class of functions that are typically non-surjective, with high-dimensional
fibers and complicated image. We prove two main results concerning the geometry …
fibers and complicated image. We prove two main results concerning the geometry …
Mathematical foundations for joining only knowing and common knowledge
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 …
proven to be useful in a variety of settings, for example to reason about coordination or …
Mathematical foundations for joining only knowing and common knowledge (extended version)
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 …
proven to be useful in a variety of settings, for example to reason about coordination or …
A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory
S Pollaci, B Kostopoulos, M Denecker… - … Conference on Logic …, 2024 - Springer
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-…
semantics of non-monotonic logics. Despite its success, AFT is not readily applicable to higher-…
Towards a Unifying View on Monotone Constructive Definitions
Constructive definitions, including inductive and recursive definitions, are ubiquitous in
mathematical texts and occur in a wide variety of computer science fields and Knowledge …
mathematical texts and occur in a wide variety of computer science fields and Knowledge …
A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory (Extended Version)
S Pollaci, B Kostopoulos, M Denecker… - arXiv preprint arXiv …, 2024 - arxiv.org
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-…
semantics of non-monotonic logics. Despite its success, AFT is not readily applicable to higher-…
[PDF][PDF] Multi-Objective Scheduling for Agricultural Interventions
Monitoring crops and fields is an important aspect in the agricultural sector to prevent droughts,
floods or the spreading of insects and diseases. We introduce an intelligent solution to …
floods or the spreading of insects and diseases. We introduce an intelligent solution to …
A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint
S Pollaci, B Kostopoulos, M Denecker2D - Logic Programming and … - books.google.com
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-…
semantics of non-monotonic logics. Despite its success, AFT is not readily applicable to higher-…
[PDF][PDF] SAT-Based Enumeration Of Solutions To The Yang-Baxter Equation
S Pollaci - bnaic2024.sites.uu.nl
When mathematicians develop theories, it is important to have examples of the structures that
are studied. These can be used to generate conjectures about the structures at hand, or as …
are studied. These can be used to generate conjectures about the structures at hand, or as …