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 27/10
🧠Researchers introduce the Universal Quantum Transformer (UQT), a quantum computing architecture that achieves exact mathematical reasoning on discrete problems like modular arithmetic and permutation groups—tasks where classical neural networks require massive parameter scaling and remain stochastically unstable. The UQT demonstrates computational advantages by bypassing classical attention's quadratic bottleneck and has been successfully deployed on current IBM Quantum hardware.
$SU
AINeutralarXiv – CS AI · Jun 86/10
🧠CAF-Gen is a new multi-agent AI system that automatically enriches basic argument structures into complex, formally-structured argumentation models using the Carneades Argumentation Framework. The iterative Creator-Reviewer pipeline improves reasoning formalization in computational linguistics by validating outputs through collaborative feedback loops rather than single-pass generation.
AINeutralarXiv – CS AI · Jun 16/10
🧠BoxLitE introduces a new knowledge base embedding model for DL-Lite ontologies that leverages convex optimization to represent hierarchical conceptual knowledge. The research demonstrates that faithful embeddings can be mathematically formulated as convex optimization problems, combining classical knowledge graph embeddings with ontology-based reasoning.
AINeutralarXiv – CS AI · May 296/10
🧠Researchers used AI-assisted methods to prove that Poincaré polynomials of moduli spaces of rational curves have only real roots, resolving a longstanding conjecture in algebraic geometry. The breakthrough employs a novel bivariate deformation technique that reveals hidden mathematical structures, with implications for understanding the topological properties of geometric spaces.
🏢 Google
AINeutralarXiv – CS AI · May 276/10
🧠A academic position paper advocates for logical pluralism in formal reasoning systems, arguing that multiple non-classical logics should coexist within unified meta-logical frameworks like LogiKEy rather than relying on single foundational logics. The research draws from two decades of work embedding diverse logics in classical higher-order logic, positioning logical pluralism as essential for interdisciplinary knowledge representation and reasoning in computational systems.
AINeutralarXiv – CS AI · May 275/10
🧠This academic paper addresses inconsistency handling in prioritized knowledge bases by analyzing the computational complexity of query entailment and repair enumeration under three optimal repair notions (global, Pareto, completion). The work establishes formal connections between optimal repairs and argumentation theory extensions, offering theoretical foundations for knowledge base consistency management.
AINeutralarXiv – CS AI · May 126/10
🧠Open Ontologies is an open-source Rust-based system that combines LLM-driven ontology engineering with formal OWL reasoning and stable matching alignment. The research demonstrates that stable 1-to-1 matching is the critical factor for ontology alignment quality, achieving F1 scores competitive with state-of-the-art systems, while structured tool access via Model Context Protocol significantly outperforms raw file reading for LLM interaction.
AIBearisharXiv – CS AI · Apr 66/10
🧠Researchers introduced ChomskyBench, a new benchmark for evaluating large language models' formal reasoning capabilities using the Chomsky Hierarchy framework. The study reveals that while larger models show improvements, current LLMs face severe efficiency barriers and are significantly less efficient than traditional algorithmic programs for formal reasoning tasks.
AIBullishHugging Face Blog · Jul 106/108
🧠Kimina-Prover represents a breakthrough in formal reasoning by applying test-time reinforcement learning search to large language models. This approach enhances mathematical proof generation and formal verification capabilities, potentially advancing AI's ability to handle complex logical reasoning tasks.
