AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
TL;DR
A proof checker called Nörgler is introduced that builds upon and extends the established approach pioneered by GDV and supports checking propositional, (untyped and typed) first-order, and higher-order refutations represented in TSTP.
This is the first, to the authors' knowledge, integration of an LLM with a termination-analysis algorithm, solving 39% more problems than the best LLM alone and more than tripling the number solved by the built-in analysis on their benchmark.
This paper presents formal proofs of confluence for beta-reduction and of alpha-commutative relations, and develops a theory of alpha-commutative relations which, in the author's view, entails a clearer presentation and treatment of the problem than in similar developments.
FLEX is presented, a foundational Constrained Horn Clause (CHC) solver implemented in LEAN, that reduces the trusted base to the kernel alone, and allows using LEAN's entire proof ecosystem to verify low-level systems code, via three contributions.
This work develops a reconstruction pipeline from the Alethe proof format, produced by cvc5, to Lambdapi, a proof assistant for the λ Π / ≡ - calculus, and provides an encoding of the SMT-LIB logic in Lambdapi, certify a substantial fragment of the Alethe inference rules.
A QuickCheck testing method based on generating and shrinking random execution traces based on checking if the first and last terms of a generated trace share the same deterministic normal form that efficiently finds counterexamples and enables fast, robust shrinking.
This paper introduces the strategy language of Pgeon, a meta-prover with a clear separation between inference rules and proof search, designed to handle the challenge of fair proof search in semi-decidable logics.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.