Suchergebnisse - Computing methodologies → Theorem proving algorithms

Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling von Soos, Mate, Meel, Kuldeep S.

“… Given a Boolean formula φ over the set of variables X and a projection set \mathcal{P} \subseteq X, then if \mathcal{I} \subseteq \mathcal{P} is independent …”
Volltext

A Theorem Proving Approach to Programming Language Semantics von Roy, Subhajit

“… We argue that modern theorem provers are excellent aids to teaching and understanding programming language semantics …”
Volltext

QEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement Learning von Sanchez-Stern, Alex, Varghese, Abhishek, Kaufman, Zhanna, Zhang, Dylan, Ringer, Talia, Brun, Yuriy

“… Recent methods have automated some proof synthesis by guiding a search through the proof space using a theorem prover …”
Volltext

Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments von Jung, Jean Christoph, Wolter, Frank

“… In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication. In …”
Volltext

A Logic for Locally Complete Abstract Interpretations von Bruni, Roberto, Giacobazzi, Roberto, Gori, Roberta, Ranzato, Francesco

“… We introduce the notion of local completeness in abstract interpretation and define a logic for proving both the correctness and incorrectness of some program specification …”
Volltext

AI-Assisted Autoformalization of Combinatorics Problems in Proof Assistants von Doan, Long, Nguyen, ThanhVu

“… Proof assistants such as Coq and LEAN have been increasingly used by renowned mathematicians to formalize and prove mathematical theorems …”
Volltext

Leveraging Critical Proof Obligations for Efficient IC3 Verification von Zhu, Lingfeng, Zhang, Xindi, Li, Yongjian, Cai, Shaowei

“… IC3 and its variants are SAT-based model-checking methods that play a critical role in hardware verification. Efficient management of proof obligations, which …”
Volltext

Combinatorial Proofs and Decomposition Theorems for First-order Logic von Hughes, Dominic J. D., Strasburger, Lutz, Wu, Jui-Hsuan

“… We show that the two proof representations are related via a deep inference decomposition theorem that establishes a new kind of normal form for syntactic proofs. This yields …”
Volltext

Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes von Dreier, Jan

“… The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem …”
Volltext

Separating Rank Logic from Polynomial Time von Lichter, Moritz

“… In the search for a logic capturing polynomial time the most promising candidates are Choiceless Polynomial Time (CPT) and rank logic. Rank logic extends …”
Volltext

A Quantum Interpretation of Bunched Logic & Quantum Separation Logic von Zhou, Li, Barthe, Gilles, Hsu, Justin, Ying, Mingsheng, Yu, Nengkun

“… We exercise the logic for proving the security of quantum one-time pad and secret sharing, and we show how the program logic can be used to discover a flaw in Google Cirq's tutorial …”
Volltext

Some constructive variants of S4 with the finite model property von Balbiani, Philippe, Dieguez, Martin, Fernandez-Duque, David

“… The logics CS4 and IS4 are intuitionistic variants of the modal logic S4. Whether the finite model property holds for each of these logics has been a …”
Volltext

CoqPilot, a plugin for LLM-based generation of proofs von Kozyrev, Andrei, Solovev, Gleb, Khramov, Nikita, Podkopaev, Anton

“… We present CoqPilot, a VS Code extension designed to help automate writing of Coq proofs. The plugin collects the parts of proofs marked with the admit tactic …”
Volltext

On the logical structure of choice and bar induction principles von Brede, Nuria, Herbelin, Hugo

“… We develop an approach to choice principles and their contrapositive bar-induction principles as extensionality schemes connecting an "intensional" or …”
Volltext

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP von Barto, Libor, Brady, Zarathustra, Bulatov, Andrei, Kozik, Marcin, Zhuk, Dmitriy

“… This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP …”
Volltext

The Topological Mu-Calculus: completeness and decidability von Baltag, Alexandru, Bezhanishvili, Nick, Fernandez-Duque, David

“… We study the topological µ-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over T 0 and T D spaces …”
Volltext

First-Order Reasoning and Efficient Semi-Algebraic Proofs von Part, Fedor, Thapen, Neil, Tzameret, Iddo

“… Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms [3 …”
Volltext

Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication von de Groot, Jim, Litak, Tadeusz, Pattinson, Dirk

“… Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of …”
Volltext

A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours von Liu, Xinxin, Yu, Tingting

“… We present an equational inference system for finite-state expressions, and prove that the system is sound and complete with respect to divergence preserving …”
Volltext

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics von Balasubramanian, A. R., Lang, Timo, Ramanayake, Revantha

“… We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FL ew (i.e. IMALLW) that have a …”
Volltext