arXiv:2606. 26460v1 Announce Type: new Abstract: AI-based scientific automation is increasingly possible by using agents to generate hypotheses, design experiments, and analyze data.
The paper introduces a computational model that encodes symbolic knowledge as mental programs combining natural language and source code, and uses LLM-guided Bayesian learning to sequentially infer these programs. It demonstrates that this approach satisfies data‑efficiency, uncertainty handling, and flexibility, reproducing human inductive learning and active inquiry behaviors such as anchoring and garden‑pathing. In contrast, pure LLMs and classic Bayesian models either fail the task, do not match human behavior, or require prohibitive computational resources.
arXiv:2606. 09856v1 Announce Type: cross Abstract: Post-training Large Language Models (LLMs) for reasoning typically focuses on deductive tasks such as mathematics and coding where correctness is verifiable.
arXiv:2608.23205v1 Announce Type: new Abstract: Large Reasoning Models (LRMs) have revolutionized reasoning in LLMs, and the increasing public availability of reasoning traces creates valuable opport...
arXiv:2512. 03476v3 Announce Type: replace-cross Abstract: Progress in computational science depends on complex numerical workflows that must faithfully encode physical laws, yet translating conceptual insight into reliable code remains a major bottleneck.
The study examines how the effort expended by large reasoning models (LRMs) compares to that of humans during abductive reasoning tasks. By analyzing reaction times and reasoning traces, the authors find that LRMs and humans exhibit similar patterns of effort and error types. They also demonstrate that decoding strategies allowing models to explore multiple reasoning paths further align the models’ reasoning costs with human effort.
Thought‑Like‑Pro is a learning framework that enhances large language models’ reasoning by combining imitation learning with a Prolog logic engine. The approach imitates chain‑of‑thought processes verified by symbolic reasoning, allowing models to formulate rules from instructions and convert Prolog‑derived reasoning trajectories into natural language. Experiments show significant reasoning improvements and robust generalization with only a marginal performance drop on distributional extrapolation tasks.
arXiv:2606. 13220v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly used as interactive assistants for technical problem solving.
The paper investigates whether current reasoning models exhibit systematicity—the idea that understanding one concept should extend to closely related variations—by extending rule induction tasks from cognitive science. Using task isomorphisms like recombination and substitution, the authors generate structurally equivalent task variants and test models on them. Results show that while models can solve the original tasks, they frequently fail on these equivalent variants, indicating a lack of systematicity in their reasoning abilities.
arXiv:2608.16831v2 Announce Type: replace Abstract: Pretrained large language models offer a practical foundation for learning useful behavior from few task-specific examples. We argue that current p...
arXiv:2510. 19698v3 Announce Type: replace Abstract: Large Language Models (LLMs) can propose rules in natural language, sidestepping the need for a predefined predicate space in traditional rule learning.
arXiv:2607. 20520v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly evaluated on mathematical problem solving, yet prior work often treats representationally equivalent formulations as interchangeable and conflates reasoning errors with interface failures.