Sciweavers

202 search results - page 8 / 41
» Proof Search in Minimal Logic
Sort
View
AGP
2010
IEEE
14 years 19 days ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
Alberto Momigliano, Mario Ornaghi
CADE
2010
Springer
13 years 8 months ago
Sledgehammer: Judgement Day
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
Sascha Böhme, Tobias Nipkow
CSL
2005
Springer
14 years 1 months ago
Permutative Logic
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet
WEA
2010
Springer
397views Algorithms» more  WEA 2010»
14 years 2 months ago
A New Combinational Logic Minimization Technique with Applications to Cryptology
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
Joan Boyar, René Peralta
AISC
1998
Springer
13 years 11 months ago
Instantiation of Existentially Quantified Variables in Inductive Specification Proofs
Abstract. We present an automatic approach for instantiating existentially quantified variables in inductive specifications proofs. Our approach uses first-order meta-variables in ...
Brigitte Pientka, Christoph Kreitz