A Goal-Set Characterization of Task Composition in the Boolean Task Algebra

arXiv:2606.04053 · cs.LG, cs.AI · Submitted 2026-06-02 · Read on arXiv

cs.LG, cs.AI

Submitted: 2026-06-02

Updated: 2026-10-04

Terminology

• Boolean Task Algebra — 2× in this paper
• Reinforcement Learning — 1× in this paper · explained in 4 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks