Results 1  10
of
228
Learning Stochastic Logic Programs
, 2000
"... Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic contextfree grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a firstorder r ..."
Abstract

Cited by 1194 (81 self)
 Add to MetaCart
order rangerestricted definite clause. This paper summarises the syntax, distributional semantics and proof techniques for SLPs and then discusses how a standard Inductive Logic Programming (ILP) system, Progol, has been modied to support learning of SLPs. The resulting system 1) nds an SLP with uniform
The Use of Explicit Plans to Guide Inductive Proofs
 9TH CONFERENCE ON AUTOMATED DEDUCTION
, 1988
"... We propose the use of explicit proof plans to guide the search for a proof in automatic theorem proving. By representing proof plans as the specifications of LCFlike tactics, [Gordon et al 79], and by recording these specifications in a sorted metalogic, we are able to reason about the conjectures ..."
Abstract

Cited by 295 (40 self)
 Add to MetaCart
We propose the use of explicit proof plans to guide the search for a proof in automatic theorem proving. By representing proof plans as the specifications of LCFlike tactics, [Gordon et al 79], and by recording these specifications in a sorted metalogic, we are able to reason about
Experiments with Proof Plans for Induction
 Journal of Automated Reasoning
, 1992
"... The technique of proof plans, is explained. This technique is used to guide automatic inference in order to avoid a combinatorial explosion. Empirical research is described to test this technique in the domain of theorem proving by mathematical induction. Heuristics, adapted from the work of Boye ..."
Abstract

Cited by 105 (37 self)
 Add to MetaCart
The technique of proof plans, is explained. This technique is used to guide automatic inference in order to avoid a combinatorial explosion. Empirical research is described to test this technique in the domain of theorem proving by mathematical induction. Heuristics, adapted from the work
Proof Search and Proof Check for Equational and Inductive Theorems
 Conference on Automated Deduction  CADE19
, 2003
"... Abstract. This paper presents ongoing researches on theoretical and practical issues of combining rewriting based automated theorem proving and userguided proof development, with the strong constraint of safe cooperation of both. In practice, we instantiate the theoretical study on the Coq proof a ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
assistant and the ELAN rewriting based system, focusing first on equational and then on inductive proofs. Different concepts, especially rewriting calculus and deduction modulo, contribute to define and to relate proof search, proof representation and proof check.
The Use of Planning Critics in Mechanizing Inductive Proofs
 International Conference on Logic Programming and Automated Reasoning  LPAR 92, St. Petersburg, Lecture Notes in Artificial Intelligence No. 624
, 1992
"... Proof plans provide a technique for guiding the search for a proof in the context of tactical style reasoning. We propose an extension to this technique in which failure may be exploited in the search for a proof. This extension is based upon the concept of planning critics. In particular we ill ..."
Abstract

Cited by 61 (12 self)
 Add to MetaCart
Proof plans provide a technique for guiding the search for a proof in the context of tactical style reasoning. We propose an extension to this technique in which failure may be exploited in the search for a proof. This extension is based upon the concept of planning critics. In particular we
Proof search and induction choices in AF 2 system
"... We consider, in this paper, the AF 2 system with the aim to automatize the proof search process considering the possibilities to synthesize programs but also to prove some properties of the programs. In our work, we consider an analysis of program specifications to take in charge the problem of indu ..."
Abstract
 Add to MetaCart
of induction choice and we propose adequate induction schemas to instantiate the induction step in the proof search process. In a certain way, our analysis allows to generate a proof strategy based on a specic proof form (including an adequate induction) for different kinds of function specifications. Thus we
Automating inductive Specification Proofs
, 1999
"... We present an automatic method which combines logical proof search and rippling heuristics to prove specifications. The key idea is to instantiate metavariables in the proof with a simultaneous match based on rippling/reverse rippling heuristic. Underlying our rippling strategy is the rippling dist ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We present an automatic method which combines logical proof search and rippling heuristics to prove specifications. The key idea is to instantiate metavariables in the proof with a simultaneous match based on rippling/reverse rippling heuristic. Underlying our rippling strategy is the rippling
Extracting Proofs from Tabled Proof Search
"... Abstract. We consider the problem of model checking specifications involving coinductive definitions such as are available for bisimulation. A proof search approach to model checking with such specifications often involves state exploration. We consider four different tabling strategies that can mi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We consider the problem of model checking specifications involving coinductive definitions such as are available for bisimulation. A proof search approach to model checking with such specifications often involves state exploration. We consider four different tabling strategies that can
Proof Search in Minimal Logic
, 2000
"... this paper was the necessity to have a guide for our implementation, we have paid particular attention to write at least the parts of the proofs with algorithmic content as clear and complete as possible. The paper is organized as follows. Section 2 defines the pattern unification algorithm, and in ..."
Abstract
 Add to MetaCart
, and in section 3 its correctness and completeness is proved. Section 4 presents the proof search algorithm, and again its correctness and completeness is proved. The final section 5 contains what we have to say about extensions to and 9. 2 The unification algorithm Unif We work in the simply typed calculus
Using Failure to Guide Inductive Proof
 JOURNAL OF AUTOMATED REASONING
, 1992
"... Lemma discovery and generalization are two of the major hurdles in automating inductive proof. This paper addresses aspects of these related problems. We build upon rippling, a heuristic which plays a pivotal role in guiding inductive proof. Rippling provides a highlevel explanation of how to c ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Lemma discovery and generalization are two of the major hurdles in automating inductive proof. This paper addresses aspects of these related problems. We build upon rippling, a heuristic which plays a pivotal role in guiding inductive proof. Rippling provides a highlevel explanation of how
Results 1  10
of
228