Results 11 to 20 of about 22,264 (219)
Separation logic + superposition calculus = heap theorem prover [PDF]
ACM SIGPLAN Notices, 2011 Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising foundation for dealing with heap manipulating programs, while the development of practical automated deduction/satisfiability checking tools for separation logic is a ...
Juan Antonio Navarro Pérez +1 more
openaire +3 more sources
A Combined Superposition and Model Evolution Calculus
Journal of Automated Reasoning, 2010 The paper presents a new calculus for first-order theorem proving with equality, which generalizes both the superposition calculus and the model evolution calculus (with equality). This calculus integrates the inference rules of superposition and of model evolution preserving the individual semantically-based redundancy criteria of both calculi in a ...
Baumgartner, Peter, Waldmann, Uwe
openaire +4 more sources
On the (In-)Completeness of Destructive Equality Resolution in the Superposition Calculus
Lecture Notes in Computer ScienceAbstract Bachmair’s and Ganzinger’s abstract redundancy concept for the Superposition Calculus justifies almost all operations that are used in superposition provers to delete or simplify clauses, and thus to keep the clause set manageable.
Uwe Waldmann
exaly +7 more sources
AC Simplifications and Closure Redundancies in the Superposition Calculus [PDF]
, 2021 Reasoning in the presence of associativity and commutativity (AC) is well known to be challenging due to prolific nature of these axioms. Specialised treatment of AC axioms is mainly supported by provers for unit equality which are based on Knuth-Bendix completion. The main ingredient for dealing with AC in these provers are ground joinability criteria
André Duarte, Konstantin Korovin
openaire +3 more sources
Hierarchic Superposition Revisited [PDF]
, 2019 Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic.
Baumgartner, P., Waldmann, U.
core +5 more sources
Geofluids, 2022 Aiming at the problem of the deformation of the roadway floor plate during the laneway during the retention period, the mechanical model of the roadway floor is established, and the deformation characteristics of the roadway floor and the change law of ...
Dongdong Pang +7 more
doaj +1 more source
Integrating Linear Arithmetic into Superposition Calculus [PDF]
, 2007 We present a method of integrating linear rational arithmetic into superposition calculus for first-order logic. One of our main results is completeness of the resulting calculus under some finiteness assumptions. © Springer-Verlag Berlin Heidelberg 2007.
Korovin, Konstantin, Voronkov, Andrei
openaire +2 more sources
On the Canonical Connection for Smooth Envelopes
Demonstratio Mathematica, 2014 A notion known as smooth envelope, or superposition closure, appears naturally in several approaches to generalized smooth manifolds, which were proposed in the last decades. Such an operation is indispensable in order to perform differential calculus. A
Moreno Giovanni
doaj +1 more source
Ground Joinability and Connectedness in the Superposition Calculus
, 2022 Abstract Problems in many theories axiomatised by unit equalities (UEQ), such as groups, loops, lattices, and other algebraic structures, are notoriously difficult for automated theorem provers to solve. Consequently, there has been considerable effort over decades in developing techniques to handle these theories, notably in the context of ...
André Duarte, Konstantin Korovin
openaire +1 more source
Typing Quantum Superpositions and Measurement [PDF]
, 2017 We propose a way to unify two approaches of non-cloning in quantum lambda-calculi. The first approach is to forbid duplicating variables, while the second is to consider all lambda-terms as algebraic-linear functions.
A Díaz-Caro +5 more
core +3 more sources