Results 1  10
of
12
Firstorder resolution for CTL
"... In this paper, we describe an approach to theorem proving in Computational Tree Logic (CTL) which utilises classical firstorder resolution techniques. Since there already exist a lot of welldeveloped firstorder logic theorem provers, reusing those techniques provides great benefit for solving oth ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In this paper, we describe an approach to theorem proving in Computational Tree Logic (CTL) which utilises classical firstorder resolution techniques. Since there already exist a lot of welldeveloped firstorder logic theorem provers, reusing those techniques provides great benefit for solving
First Order Logic in Semantic Tableau and VAMPIRE
"... Semantic tableau is a proof system used to prove the validity of a formula using Prolog, it can also be used to prove if a formula is a logic consequence of a set of formulas. Semantic tableau is used in both propositional and predicate logic. Tableau is a disjunction normal form. VAMPIRE is a high ..."
Abstract
 Add to MetaCart
highperformance theorem prover for firstorder logic with or without equality. In this paper, a modified version of semantic tableau is presented, experimental results proved the validity of modified tableau. Also, it is shown how Tableau proof system and VAMPIRE can be used in predicate logic.
Breeding Theorem Proving Heuristics with Genetic Algorithms
"... Firstorder theorem provers have to search for proofs in an infinite space of possible derivations. Proof search heuristics play a vital role for the practical performance of these systems. In the current generation of saturationbased theorem provers like SPASS, E, Vampire or Prover 9, one of the m ..."
Abstract
 Add to MetaCart
Firstorder theorem provers have to search for proofs in an infinite space of possible derivations. Proof search heuristics play a vital role for the practical performance of these systems. In the current generation of saturationbased theorem provers like SPASS, E, Vampire or Prover 9, one
Using Vampire in Soundness Proofs of Type Systems
"... Type systems for programming languages shall detect type errors in programs before runtime. To ensure that a type system meets this requirement, its soundness must be formally verified. We aim at automating soundness proofs of type systems to facilitate the development of sound type systems for doma ..."
Abstract
 Add to MetaCart
provers such as Vampire with automated proof strategies specific to type systems. In this paper, we describe how we encode type soundness proofs in firstorder logic using TPTP. We show how we use Vampire to prove the soundness of type systems for the simplytyped lambda calculus and for parts of a typed
An Ordered Theory Resolution Calculus for Hybrid Reasoning in Firstorder Extensions of Description Logic
"... Systems for hybrid reasoning with firstorder logic (FOL) extensions of description logic (DL) date back at least 20 years and are enjoying a renewed interest in the context of recent FOL extensions of OWL DL for the Semantic Web. However, current systems for reasoning with such languages can only h ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Systems for hybrid reasoning with firstorder logic (FOL) extensions of description logic (DL) date back at least 20 years and are enjoying a renewed interest in the context of recent FOL extensions of OWL DL for the Semantic Web. However, current systems for reasoning with such languages can only
An Ordered Theory Resolution Calculus for Hybrid Reasoning in Firstorder Extensions of Description Logic
"... Systems for hybrid reasoning with firstorder logic (FOL) extensions of description logic (DL) date back at least 20 years and are enjoying a renewed interest in the context of recent FOL extensions of OWL DL for the Semantic Web. However, current systems for reasoning with such languages can only h ..."
Abstract
 Add to MetaCart
Systems for hybrid reasoning with firstorder logic (FOL) extensions of description logic (DL) date back at least 20 years and are enjoying a renewed interest in the context of recent FOL extensions of OWL DL for the Semantic Web. However, current systems for reasoning with such languages can only
Sledgehammer: Judgement Day
 In Giesl and Hähnle [62
"... Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higherorder logic by calling the automated provers for firstorder logic E, SPASS and Vampire. This paper is the largest and most detailed empirical evaluation of such a link to date. Our test data cons ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higherorder logic by calling the automated provers for firstorder logic E, SPASS and Vampire. This paper is the largest and most detailed empirical evaluation of such a link to date. Our test data
Automated Reasoning: Past Story and New Trends*
"... We overview the development of firstorder automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems, we also try to predict new trends in firstorder automated reasoning. Our presentation will be centered around two main ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
of the theorem prover Vampire, see [Riazanov and Voronkov, 2002a]. It reflects our recent experience with applications of Vampire in verification, proof assistants, theorem proving, and semantic Web, as well as the analysis of future potential applications. 1 Theorem Proving in FirstOrder Logic The idea
A Survey of Some Recent Trends in RewriteBased and ParamodulationBased Deduction
"... Introduction Deduction with equality is fundamental in mathematics, logics and many applications of formal methods in computer science. During the last two decades this field has importantly progressed through new KnuthBendixlike completion techniques and their extensions to ordered paramodulatio ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
paramodulation for firstorder clauses. These techniques have lead to important results on deduction in firstorder logic with equality, like [HR91,BDH86,BD94,BG94,BG98,NR01], results that have been applied to stateoftheart theorem provers like Spass [Wei97] and Vampire [RV01]. These techniques have also led
System Description: E.T. 0.1
"... Abstract. E.T. 0.1 is a metasystem specialized for theorem proving over large firstorder theories containing thousands of axioms. Its design is motivated by the recent theorem proving experiments over the Mizar, Flyspeck and Isabelle datasets. Unlike other approaches, E.T. does not learn from rel ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. E.T. 0.1 is a metasystem specialized for theorem proving over large firstorder theories containing thousands of axioms. Its design is motivated by the recent theorem proving experiments over the Mizar, Flyspeck and Isabelle datasets. Unlike other approaches, E.T. does not learn from
Results 1  10
of
12