Search Results - Constraint and logic programming Theorem proving

Implementing type theory in higher order constraint logic programming by GUIDI, FERRUCCIO, SACERDOTI COEN, CLAUDIO, TASSI, ENRICO

“…In this paper, we are interested in high-level programming languages to implement the core components of an interactive theorem prover for a dependently typed language: the kernel…”
Get full text

Automated Deduction – CADE 29: 29th International Conference on Automated Deduction, Rome, Italy, July 1–4, 2023, Proceedings by Pientka, Brigitte, Tinelli, Cesare

“…This open access book constitutes the proceedings of the 29th International Conference on Automated Deduction, CADE 29, which took place in Rome, Italy, during…”
Get full text

Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments by 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…”
Get full text

A Quantum Interpretation of Bunched Logic & Quantum Separation Logic by 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…”
Get full text

Proceedings 38th International Conference on Logic Programming by Lierler, Yuliya, Morales, Jose F, Dodaro, Carmine, Dahl, Veronica, Gebser, Martin, Tekle, Tuncay

“… Related Paradigms and Synergies: Inductive and coinductive logic programming, Constraint logic programming, Answer set programming, Interaction with SAT, SMT and CSP…”
Get full text

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

“… Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion graph classes…”
Get full text

Some constructive variants of S4 with the finite model property by 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 long-standing open problem…”
Get full text

Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication by 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 axioms for strict implication provable…”
Get full text

Proceedings 37th International Conference on Logic Programming (Technical Communications) by misano, Andrea, Liu, Yanhong Annie, Bogaerts, Bart, Brik, Alex, Dahl, Veronica, Dodaro, Carmine, Fodor, Paul, Pozzato, Gian Luca, Vennekens, Joost, Zhou, Neng-Fa

“… Related Paradigms and Synergies: Inductive and coinductive logic programming, Constraint logic programming, Answer set programming, Interaction with SAT, SMT and CSP…”
Get full text

Formalizing UML/OCL structural features with FoCaLiZe by Abbas, Messaoud, Ben-Yelles, Choukri-Bey, Rioboo, Renaud

“…) is used within UML models to specify model constraints. Several UML/OCL tools provide Model-Driven Engineering transformation into general object-oriented programming languages such as Java and C++…”
Get full text

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP by 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…”
Get full text

Categorical models of Linear Logic with fixed points of formulas by Ehrhard, Thomas, Jafarrahmani, Farzad

“…We develop a categorical semantics of µLL, a version of propositional Linear Logic with least and greatest fixed points extending David Baelde's propositional…”
Get full text

A Constructive Logic with Classical Proofs and Refutations by Barenbaum, Pablo, Freund, Teodoro

“…We study a conservative extension of classical propositional logic distinguishing between four modes of statement…”
Get full text

Axiomatizations and Computability of Weighted Monadic Second-Order Logic by Achilleos, Antonis, Pedersen, Mathias Ruggaard

“…Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata…”
Get full text

Accelerating All-SAT Computation with Short Blocking Clauses by Zhang, Yueling, Pu, Geguang, Sun, Jun

“…The All-SAT (All-SATisfiable) problem focuses on finding all satisfiable assignments of a given propositional formula, whose applications include model checking, automata construction, and logic minimization…”
Get full text

Proceedings 36th International Conference on Logic Programming (Technical Communications) by Ricca, Francesco, Russo, Alessandra, Greco, Sergio, Leone, Nicola, Artikis, Alexander, Friedrich, Gerhard, Fodor, Paul, Kimmig, Angelika, Lisi, Francesca, Maratea, Marco, Mileo, Alessandra, Riguzzi, Fabrizio

“…, SMT and CSP solvers, Logic programming techniques for type inference and theorem proving…”
Get full text

Automated Deduction - CADE 28: 28th International Conference on Automated Deduction, Virtual Event, July 12-15, 2021, Proceedings by Platzer, André, Sutcliffe, Geoff

“…This open access book constitutes the proceeding of the 28th International Conference on Automated Deduction, CADE 28, held virtually in July 2021. The 29 full…”
Get full text

Constraint solving for finite model finding in SMT solvers by REYNOLDS, ANDREW, TINELLI, CESARE, BARRETT, CLARK

“… In this paper, we reduce these limitations by integrating finite model finding techniques based on constraint solving into the architecture used by modern SMT solvers…”
Get full text

A framework for testing first-order logic axioms in program verification by Ahn, Ki Yung, Denney, Ewen

“…Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code…”
Get full text

Proceedings 35th International Conference on Logic Programming (Technical Communications) by Bogaerts, Bart, Erdem, Esra, Fodor, Paul, misano, Andrea, Ianni, Giovambattista, Inclezan, Daniela, Vidal, German, Villanueva, Alicia, De Vos, Marina, Yang, Fangkai

“…Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming…”
Get full text