AIBullisharXiv – CS AI · Jun 197/10
🧠Researchers demonstrate that the Lean proof assistant can provide fine-grained, process-level feedback during reinforcement learning training for theorem proving, beyond simple binary verification signals. By parsing proof attempts into tactic sequences and leveraging Lean's elaboration system, the approach delivers dense, verified credit signals grounded in type theory, showing improvements over outcome-only baselines on benchmarks like MiniF2F and ProofNet.
AIBullisharXiv – CS AI · Jun 37/10
🧠Researchers introduced AuditFlow, a multi-agent AI framework that combines language models with symbolic environments to verify structured financial reporting. The system achieved 82% accuracy in audit verification by separating adaptive search from deterministic symbolic checks, demonstrating that deterministic verification—not language models alone—drives reliable audit outcomes.
🧠 GPT-5
AIBullisharXiv – CS AI · May 297/10
🧠Researchers used large language models and evolutionary search to create the first domain-independent heuristics for symbolic AI planning that surpass hand-engineered baselines. These evolved heuristics, written in C++, solve more planning tasks than existing state-of-the-art approaches and maintain the soundness guarantees of traditional planners.
AIBullisharXiv – CS AI · Apr 147/10
🧠Researchers propose VaCoAl, a hyperdimensional computing architecture that combines sparse distributed memory with Galois-field algebra to address limitations in modern AI systems like catastrophic forgetting and the binding problem. The deterministic system demonstrates emergent properties equivalent to spike-timing-dependent plasticity and achieves multi-hop reasoning across 25.5M paths in knowledge graphs, positioning it as a complementary third paradigm to large language models.
AINeutralarXiv – CS AI · Mar 267/10
🧠Researchers propose a new symbolic-mechanistic approach to evaluate AI models that goes beyond accuracy metrics to detect whether models truly generalize or rely on shortcuts like memorization. Their method combines symbolic rules with mechanistic interpretability to reveal when models exploit patterns rather than learn genuine capabilities, demonstrated through NL-to-SQL tasks where a memorization model achieved 94% accuracy but failed true generalization tests.
AINeutralarXiv – CS AI · Mar 177/10
🧠Researchers propose shifting from large monolithic AI models to domain-specific superintelligence (DSS) societies due to unsustainable energy costs and physical constraints of current generative AI scaling approaches. The alternative involves smaller, specialized models working together through orchestration agents, potentially enabling on-device deployment while maintaining reasoning capabilities.
AIBullisharXiv – CS AI · Mar 97/10
🧠Researchers developed Localized In-Context Learning (L-ICL), a technique that significantly improves large language model performance on symbolic planning tasks by targeting specific constraint violations with minimal corrections. The method achieves 89% valid plan generation compared to 59% for best baselines, representing a major advancement in LLM reasoning capabilities.
AINeutralarXiv – CS AI · Mar 47/104
🧠Researchers have introduced SorryDB, a dynamic benchmark for evaluating AI systems' ability to prove mathematical theorems using the Lean proof assistant. The benchmark draws from 78 real-world formalization projects and addresses limitations of static benchmarks by providing continuously updated tasks that better reflect community needs.
AINeutralarXiv – CS AI · Jun 196/10
🧠Researchers demonstrate that Information Lattice Learning (ILL), a technique for discovering interpretable rules in signals, naturally aligns with probabilistic graphical model structure learning when applied to probability distributions. The work reveals that ILL rules correspond to marginal constraints over abstracted variables, with maximum-entropy reconstruction creating constraint-based factor graphs rather than traditional Bayesian networks.
AINeutralarXiv – CS AI · Jun 116/10
🧠This arXiv survey examines explainable AI (XAI) methods applied to Answer Set Programming (ASP), a symbolic AI approach used for declarative reasoning. The paper catalogs existing explanation approaches and tools while identifying gaps in coverage across different user scenarios, establishing a foundation for future XAI research in logic-based systems.
AINeutralarXiv – CS AI · Jun 96/10
🧠Researchers propose a variability-based framework for automatically naming concepts generated by Formal Concept Analysis (FCA) and Relational Concept Analysis (RCA) using large language models. The framework addresses the challenge of translating formally-defined but opaque symbolic abstractions into human-readable names by controlling which information sources (intent, extent, implications, relations) are exposed during naming, making semantic choices explicit and interpretable.
AINeutralarXiv – CS AI · Jun 95/10
🧠Researchers present SEF-CLGC, a framework combining formal logical notations with Small Language Models to evaluate reasoning capabilities in the SemEval-2026 Task 11. The study demonstrates that training SLMs on hybrid natural and symbolic languages achieves a 27.80% content score while reducing reasoning bias, offering insights into how formal notation impacts language model performance.
AINeutralarXiv – CS AI · Jun 46/10
🧠Researchers propose a framework for multi-agent systems that treats disagreement as valuable information rather than error to be eliminated. The approach abstracts reasoning traces into four symbolic disagreement states and applies strategic routing rules to content moderation and AI collaboration tasks.
AINeutralarXiv – CS AI · Jun 46/10
🧠Researchers propose Software 4.0, a new programming paradigm that integrates human intelligence, neural AI, and symbolic systems as a self-regulating network rather than static code. The approach aims to eliminate the architectural friction between traditional programming models and large language models by enabling software to verify and evolve its own integrity, potentially reducing computational overhead and inference costs.
AINeutralarXiv – CS AI · Jun 15/10
🧠Researchers have developed an Answer-Set Programming (ASP) based implementation of the CARCASS framework to improve Reinforcement Learning abstractions for complex state spaces. The approach leverages ASP's declarative modeling capabilities as an alternative to Prolog, demonstrating promising results in Blocks World and Minigrid domains when domain knowledge is available.
AINeutralarXiv – CS AI · May 285/10
🧠Researchers propose Generalized Holographic Reduced Representations (GHRR), an advancement in Hyperdimensional Computing that improves how complex data structures are encoded through a flexible, non-commutative binding operation. The framework demonstrates enhanced performance when applied to transformer models, suggesting potential efficiency improvements for AI systems that bridge symbolic and connectionist approaches.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers extend bounded fitting—a machine learning paradigm for logical formula discovery—to more expressive description logics beyond ALC, maintaining PAC-style guarantees while implementing practical solutions via SAT solvers. The work demonstrates that this approach scales to complex logical systems with inverse roles and qualified restrictions, achieving competitive results against existing concept learners.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers have developed a parallel lifted planning algorithm using semi-naive Datalog evaluation that significantly accelerates classical AI planning by combining rule-level and grounding-level parallelism. The approach achieves up to 6-fold speedup on 8 cores and solves more planning tasks than existing baselines, particularly on computationally intensive grounding operations.
AINeutralarXiv – CS AI · May 76/10
🧠Researchers introduce NoisyCausal, a benchmark for testing how well large language models handle causal reasoning when presented with noisy, incomplete, or misleading information. The study proposes a modular framework combining LLMs with explicit causal graph structures, demonstrating significant improvements over standard prompting approaches and better generalization across external benchmarks.
AINeutralarXiv – CS AI · Apr 156/10
🧠Researchers propose a semantic bootstrapping framework that transfers knowledge from large language models into interpretable symbolic Tsetlin Machines, enabling text classification systems to achieve BERT-comparable performance while remaining fully transparent and computationally efficient without runtime LLM dependencies.
AINeutralarXiv – CS AI · Apr 146/10
🧠Researchers introduce Object-Oriented World Modeling (OOWM), a framework that structures LLM reasoning for robotic planning by replacing linear text with explicit symbolic representations using UML diagrams and object hierarchies. The approach combines supervised fine-tuning with group relative policy optimization to achieve superior planning performance on embodied tasks, demonstrating that formal software engineering principles can enhance AI reasoning capabilities.
AINeutralarXiv – CS AI · Apr 136/10
🧠Researchers present a novel approach using agentic language model feedback frameworks to generate planning domains from natural language descriptions augmented with symbolic information. The method employs heuristic search over model space optimized by various feedback mechanisms, including landmarks and plan validator outputs, to improve domain quality for practical deployment.
AIBullisharXiv – CS AI · Mar 96/10
🧠Researchers propose Hybrid Hierarchical RL (H²RL), a new framework that combines symbolic logic with deep reinforcement learning to address misalignment issues in AI agents. The method uses logical option-based pretraining to improve long-horizon decision-making and prevent agents from over-exploiting short-term rewards.
AIBullisharXiv – CS AI · Mar 44/102
🧠Researchers propose Symbolic Reward Machines (SRMs) as an improvement over traditional Reward Machines in reinforcement learning, eliminating the need for manual user input while maintaining performance. SRMs process observations directly through symbolic formulas, making them more applicable to widely adopted RL frameworks.
