Sciweavers

LPAR
2012
Springer
12 years 6 months ago
E-Matching with Free Variables
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
Philipp Rümmer
FROCOS
2011
Springer
12 years 10 months ago
Automatic Proof and Disproof in Isabelle/HOL
Abstract. Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is...
Jasmin Christian Blanchette, Lukas Bulwahn, Tobias...
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 8 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
JAR
2000
137views more  JAR 2000»
13 years 10 months ago
A Benchmark Method for the Propositional Modal Logics K, KT, S4
A lot of methods have been proposed -- and sometimes implemented -- for proof search in the propositional modal logics K, KT, and S4. It is difficult to compare the usefulness of ...
Peter Balsiger, Alain Heuerding, Stefan Schwendima...
ENTCS
2002
91views more  ENTCS 2002»
13 years 10 months ago
Memoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype
Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Proof search in this framework is based on the...
Brigitte Pientka
CORR
2008
Springer
179views Education» more  CORR 2008»
13 years 11 months ago
Induction and Co-induction in Sequent Calculus
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
Alwen Tiu, Alberto Momigliano
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 11 months ago
Graph Algorithms for Improving Type-Logical Proof Search
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
Richard Moot
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 11 months ago
Cut Elimination for a Logic with Induction and Co-induction
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
Alwen Tiu, Alberto Momigliano
CSL
2010
Springer
13 years 12 months ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel
AGP
1995
IEEE
14 years 2 months ago
A Prolog Implementation of Kem
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
Alberto Artosi, Paola Cattabriga, Guido Governator...