Results 1  10
of
21
Lightweight relevance filtering for machinegenerated resolution problems
 In ESCoR: Empirically Successful Computerized Reasoning
, 2006
"... Irrelevant clauses in resolution problems increase the search space, making it hard to find proofs in a reasonable time. Simple relevance filtering methods, based on counting function symbols in clauses, improve the success rate for a variety of automatic theorem provers and with various initial set ..."
Abstract

Cited by 33 (8 self)
 Add to MetaCart
Irrelevant clauses in resolution problems increase the search space, making it hard to find proofs in a reasonable time. Simple relevance filtering methods, based on counting function symbols in clauses, improve the success rate for a variety of automatic theorem provers and with various initial settings. We have designed these techniques as part of a project to link automatic theorem provers to the interactive theorem prover Isabelle. They should be applicable to other situations where the resolution problems are produced mechanically and where completeness is less important than achieving a high success rate with limited processor time. 1
Structured Specifications and Interactive Proofs with KIV
, 1998
"... The aim of this chapter is to describe the integrated specification and theorem proving environment of KIV. KIV is an advanced tool for developing high assurance systems. It supports:  hierarchical formal specification of software and system designs  specification of safety/security models  ..."
Abstract

Cited by 27 (22 self)
 Add to MetaCart
The aim of this chapter is to describe the integrated specification and theorem proving environment of KIV. KIV is an advanced tool for developing high assurance systems. It supports:  hierarchical formal specification of software and system designs  specification of safety/security models  proving properties of specifications  modular implementation of specification components  modular verification of implementations  incremental verification and error correction  reuse of specifications, proofs, and verified components KIV supports the entire design process from formal specifications to verified code. It supports functional as well as statebased modeling. KIV is ready for use, and has been tested in a number of indu...
Practical PartitionBased Theorem Proving for Large Knowledge Bases
, 2003
"... Query answering over commonsense knowledge bases typically employs a firstorder logic theorem prover. While firstorder inference is intractable in general, provers can often be handtuned to answer queries with reasonable performance in practice. ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
Query answering over commonsense knowledge bases typically employs a firstorder logic theorem prover. While firstorder inference is intractable in general, provers can often be handtuned to answer queries with reasonable performance in practice.
FirstOrderized ResearchCyc: Expressivity and Efficiency in a CommonSense Ontology
 In Papers from the AAAI Workshop on Contexts and Ontologies: Theory, Practice and Applications
, 2005
"... Cyc is the largest existing commonsense knowledge base. Its ontology makes heavy use of higherorder logic constructs such as a context system, first class predicates, etc. Many of these higherorder constructs are believed to be key to Cyc's ability to represent commonsense knowledge and reas ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
Cyc is the largest existing commonsense knowledge base. Its ontology makes heavy use of higherorder logic constructs such as a context system, first class predicates, etc. Many of these higherorder constructs are believed to be key to Cyc's ability to represent commonsense knowledge and reason with it efficiently. In this paper, we present a translation of a large part (around 90%) of the Cyc ontology into FirstOrder Logic. We discuss our methodology, and the tradeoffs between expressivity and efficiency in representation and reasoning. We also present the results of experiments using VAMPIRE, SPASS, and the E Theorem Prover on the firstorderized Cyc KB. Our results indicate that, while the use of higherorder logic is not essential to the representability of commonsense knowledge, it greatly improves the efficiency of reasoning.
Extending Sledgehammer with SMT Solvers
"... Abstract. Sledgehammer is a component of Isabelle/HOL that employs firstorder automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It heuristically selects relevant facts and, if an ATP is successful, produces a snippet that replays the proof in Isabelle. We extended Sl ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
Abstract. Sledgehammer is a component of Isabelle/HOL that employs firstorder automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It heuristically selects relevant facts and, if an ATP is successful, produces a snippet that replays the proof in Isabelle. We extended Sledgehammer to invoke satisfiability modulo theories (SMT) solvers as well, exploiting its relevance filter and parallel architecture. Isabelle users are now pleasantly surprised by SMT proofs for problems beyond the ATPs ’ reach. Remarkably, the best SMT solver performs better than the best ATP on most of our benchmarks. 1
An empirical evaluation of automated theorem provers in software certification
 International Journal of AI tools
, 2004
"... We describe a system for the automated certification of safety properties of NASA software. The system uses Hoarestyle program verification technology to generate proof obligations which are then processed by an automated firstorder theorem prover (ATP). We discuss the unique requirements this app ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoarestyle program verification technology to generate proof obligations which are then processed by an automated firstorder theorem prover (ATP). We discuss the unique requirements this application places on the ATPs, focusing on automation, proof checking, and usability. For full automation, however, the obligations must be aggressively preprocessed and simplified, and we demonstrate how the individual simplification stages, which are implemented by rewriting, influence the ability of the ATPs to solve the proof tasks. Our results are based on 13 certification experiments that lead to more than 25,000 proof tasks which have each been attempted by Vampire, Spass, esetheo, and Otter. The proofs found by Otter have been proofchecked by IVY. 1
Semantic Selection of Premisses for Automated Theorem Proving
"... We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in firstorder logic. The algorithm uses interpretations to semantically analyze the conjectures and the set of premisses of the given theory to find the optimal subsets of ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in firstorder logic. The algorithm uses interpretations to semantically analyze the conjectures and the set of premisses of the given theory to find the optimal subsets of the premisses. For each given conjecture the algorithm repeatedly constructs interpretations using an automated model finder, uses the interpretations to compute the optimal subset of premisses (based on the knowledge it has at the point) and tries to prove the conjecture using an automated theorem prover. 1 Importance of selecting appropriate premisses in automated theorem proving A proper set of premisses 1 can be essential for proving a conjecture by an automated theorem prover. Clearly, the larger the number of the initial premisses the larger the number of the inferred formulae. And as for the most proving techniques the number of inferred formulae is in general superexponential in the number of input formulae,
Verification of Hardware Systems with FirstOrder Logic
 Copenhagen, DIKU, University of Copenhagen, Denmark
, 2002
"... The state of the art of automatic first order logic theorem provers is advanced enough to be useful in a commercial context. This paper describes a way in which first order logic and theorem provers are used at the Swedish formal verification company Safelogic, to formally verify properties of hardw ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
The state of the art of automatic first order logic theorem provers is advanced enough to be useful in a commercial context. This paper describes a way in which first order logic and theorem provers are used at the Swedish formal verification company Safelogic, to formally verify properties of hardware systems. Two different verification methods are discussed, which both make use of translations of formalisms into first order logic. We draw some preliminary conclusions from our experiences and provide problems sets and benchmarks.
Integration of the TPTPWorld into SigmaKEE
"... This paper describes the integration of the ATP support of the TPTPWorld into the Sigma Knowledge Engineering Environment. The result is an interactive knowledge based reasoning environment, with strong knowledge management features, and access to modern state of the art ATP systems for reasoning o ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
This paper describes the integration of the ATP support of the TPTPWorld into the Sigma Knowledge Engineering Environment. The result is an interactive knowledge based reasoning environment, with strong knowledge management features, and access to modern state of the art ATP systems for reasoning over knowledge bases.
Integrating deduction techniques in a software reuse application
 J. UCS
, 1999
"... We investigate the application of automated deduction techniques to retrieve software components based on their formal specifications. The application profile has major impacts on the problem solving process and requires an open system architecture in which different deductive engines work in comb ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We investigate the application of automated deduction techniques to retrieve software components based on their formal specifications. The application profile has major impacts on the problem solving process and requires an open system architecture in which different deductive engines work in combination because the proof problems are too difficult for a single monolithic system. We describe our system architecture, a pipeline of filters of increasing deductive strength, and concentrate on the final filter, in which theorem provers are applied. Here, we use the Ilfsystem as a control and integration shell to combine different provers. We support two different combination styles, competition and cooperation. Experiments confirm our approach. With moderate timeouts we already achieve an overall recall of approximately 80%.