13 articles tagged with #automated-reasoning. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
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.
Researchers have developed a neural theorem prover for Lean that successfully solved challenging high-school mathematics olympiad problems, including those from AMC12, AIME competitions, and two problems adapted from the International Mathematical Olympiad (IMO). This represents a significant advancement in AI's ability to handle formal mathematical reasoning and proof generation.
Researchers have introduced ORCA, an AI copilot system designed to make causal analysis accessible to domain experts across manufacturing, medicine, and social science. The tool automates root cause analysis workflows while allowing users to control the level of automation, from fully automatic to highly guided execution, addressing a significant accessibility gap in complex analytical methods.
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.
Cplus2ASP Version 2 is a new system that translates action language C+ into answer set programming, offering significant performance improvements over the Causal Calculator through modern ASP solving techniques. The tool supports incremental execution, external atoms via Lua integration, and extensible translations for other action languages, making it relevant for automated reasoning and planning applications.
Researchers present an end-to-end framework that uses Large Language Models to convert natural language specifications into PDDL planning models, with iterative refinement through hardcoded and dynamic agents, then generates executable plans. The system demonstrates strong performance across multiple domains including classic planning problems where LLMs typically struggle, and integrates with established planning engines.
Researchers propose DeepInsightTheorem, a framework that teaches large language models to improve informal theorem proving by explicitly extracting and learning core mathematical techniques. The hierarchical dataset combined with a multi-stage training strategy enables LLMs to perform more insightful mathematical reasoning, outperforming existing baseline approaches on challenging benchmarks.
Researchers propose a new framework that uses LLMs as code generators rather than per-instance evaluators for high-stakes decision-making, creating interpretable and reproducible AI systems. The approach generates executable decision logic once instead of querying LLMs for each prediction, demonstrated through venture capital founder screening with competitive performance while maintaining full transparency.
Researchers introduce Delta1, a framework that integrates automated theorem generation with large language models to create explainable AI reasoning. The system combines formal logic rigor with natural language explanations, demonstrating applications across healthcare, compliance, and regulatory domains.
The article discusses the application of generative language models to automated theorem proving, representing an advancement in AI's ability to generate mathematical proofs. This development could enhance AI systems' reasoning capabilities and formal verification processes.
Researchers developed a new self-supervised Inductive Logic Programming approach called Poker that can learn recursive logic programs without requiring expert-crafted negative examples or problem-specific background theories. The system automatically generates and labels new training examples during learning, showing improved performance over existing methods when negative examples are unavailable.
Researchers introduce pact, a new SMT model counter that can handle hybrid formulas containing both discrete and continuous variables using hashing-based approximate counting. The tool significantly outperforms existing baselines, successfully processing 456 out of 3119 test instances compared to only 83 for the baseline method.
Researchers have developed an automation approach for Input/Output (I/O) Logics, a type of deontic logic used for reasoning about norms and obligations, by reducing them to propositional satisfiability problems. A prototype implementation called 'rio' (reasoner for input/output logics) has been created to demonstrate these procedures with practical examples.
