7 articles tagged with #automated-reasoning. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
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 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.
