20 results for “Formal reasoning”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper presents TypoNet, a system that constructs and validates a symbolic model of a production-scale WAN from network artifacts using large language models for translation and a solver for relia…
This paper introduces a fuzzy-logic-based qualitative extension of Answer Set Programming (ASP) to integrate numerical information and qualitative reasoning.
The paper proposes a flexible meta-programming framework to declaratively operationalize and explore varied temporal logics, such as TEL, MEL, and DEL, within standard Answer Set Programming systems.
This paper introduces dynamic epistemic paraconsistent logics AMLFI1, PALFI1, and UMLFI1, extending the epistemic paraconsistent logics KLFI1, KB4LFI1, and S5LFI1. It proves soundness and completeness…
This paper develops distributive laws for parallel composition in a rely/guarantee style theory for reasoning about concurrent programs.
This paper presents a translation scheme and correspondence analysis between Ciao assertions and LPTP formulae, enabling integration of assertion checking with LPTP-based deductive verification.
Dingling Xu, Ruobing Wang, Qingfei Zhao, Yukun Yan +7 more
The paper proposes CheckRLM, a framework that improves the reliability of Reasoning Language Models by identifying and correcting factual errors using Retrieval-Augmented Generation.
AXIOM is a trust-first neuro-symbolic execution architecture that ensures verifiable mathematical reasoning by strictly separating language model interpretation from deterministic computation, achievi…
The paper develops a novel, sound, and complete deductive proof system for proving contract satisfaction, which is crucial for verifying CPU security against side-channel attacks.
This survey provides a comprehensive analysis of Reasoning Language Model (RLM) adoption across 28 scientific disciplines, revealing significant disparities in RLM maturity across different scientific…
The paper presents a novel technology that uses zero-knowledge proofs to formally verify a software system's correctness against a public specification without revealing the system's internal details.
The paper provides a constructive, intuitionistically valid proof of Rice's Theorem and the Halting Problem undecidability by reducing the problem to the undecidability of Hilbert's Tenth Problem (MRD…