Results 261 to 270 of about 9,301 (306)

Proof Nets for Lambek Calculus

Journal of Logic and Computation, 1992
The representation of a proof as you find it in textbooks is just a linear sequence of derivation steps. This does not mean that linear sequences of derivation steps are a good representation for computer generated and computer manipulated proofs. And in fact, for various calculi there are alternative and more compact representations of proofs, for ...
openaire   +3 more sources

A Resolution Calculus for Shortening Proofs

Logic Journal of the IGPL, 2005
Summary: We propose an extended resolution calculus, called \(\delta^m\)-resolution, aiming at reducing the length of the proofs without increasing too much the branching factor of the procedure. The soundness and refutational completeness of the new calculus is proven.
openaire   +1 more source

On Proof Complexity of Resolution over Polynomial Calculus

ACM Transactions on Computational Logic, 2022
The proof system Res (PC d,R ) is a natural extension of the Resolution proof system that instead of disjunctions of literals operates with disjunctions of degree d multivariate polynomials over a ring R with Boolean variables ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy