Results 241 to 250 of about 523,591 (296)
Equivariant Isomorphism of Quantum Lens Spaces of Low Dimension. [PDF]
Commun Math PhysEilers S, Zegers SE.
europepmc +1 more source
How Long does it Take to Train an Elephant Random Walk. [PDF]
J Stat PhysFang Z.
europepmc +1 more source
Spectral Characterization of Stochastic Epidemic Variability on Regular Networks via the Kirchhoff Index. [PDF]
Entropy (Basel)Alnafisah Y, Sohaly MA.
europepmc +1 more source
Rigorous Bound on Hydrodynamic Diffusion for Chaotic Open Spin Chains. [PDF]
J Stat PhysAmpelogiannis D, Doyon B.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Automated Reasoning, 2003
The authors argue that theorem proving can be divided into a computation part and a deduction part. Deduction modulo is a method to remove the computational arguments from proofs. A proof search method is presented based on extended narrowing and resolution which is sound and complete with respect to the sequent calculus modulo, for a large class of ...
Dowek, Gilles +2 more
openaire +6 more sources
The authors argue that theorem proving can be divided into a computation part and a deduction part. Deduction modulo is a method to remove the computational arguments from proofs. A proof search method is presented based on extended narrowing and resolution which is sound and complete with respect to the sequent calculus modulo, for a large class of ...
Dowek, Gilles +2 more
openaire +6 more sources
Proving Theorems by Program Transformation [PDF]
Fundamenta Informaticae, 2013 In this paper we present an overview of the unfold/fold proof method, a method for proving theorems about programs, based on program transformation. As a metalanguage for specifying programs and program properties we adopt constraint logic programming (CLP), and we present a set of transformation rules (including the familiar unfolding and folding ...
Fabio Fioravanti +3 more
openaire +5 more sources
1986
We describe resolution proof systems for several modal logics. First we present the propositional versions of the systems and prove their completeness. The first-order resolution rule for classical logic is then modified to handle quantifiers directly.
Martín Abadi, Zohar Manna
openaire +2 more sources
We describe resolution proof systems for several modal logics. First we present the propositional versions of the systems and prove their completeness. The first-order resolution rule for classical logic is then modified to handle quantifiers directly.
Martín Abadi, Zohar Manna
openaire +2 more sources
Journal of the ACM, 1976
The concern here is with proof procedures which are generalizations of input or unit deduction. The author's generalizations of input deduction involve lemmas, whereas those of unit deduction involve longer clauses and are akin to Robinson's P1 deduction.
openaire +1 more source
The concern here is with proof procedures which are generalizations of input or unit deduction. The author's generalizations of input deduction involve lemmas, whereas those of unit deduction involve longer clauses and are akin to Robinson's P1 deduction.
openaire +1 more source
1998
In this section, we give an outline of the proof of the PCP-Theorem, which states that NP=PCP(logn,1). The key idea for reducing the number of random bits, which also implies a reduction of the length of the proof, is a more concise encoding of an assignment. Instead of linear functions we use multivariate polynomials of low degree as an encoding.
Volker Heun +2 more
openaire +1 more source
In this section, we give an outline of the proof of the PCP-Theorem, which states that NP=PCP(logn,1). The key idea for reducing the number of random bits, which also implies a reduction of the length of the proof, is a more concise encoding of an assignment. Instead of linear functions we use multivariate polynomials of low degree as an encoding.
Volker Heun +2 more
openaire +1 more source