Results 1  10
of
6,617
Structural Induction and the
"... Abstract. We consider formal provability with structural induction and related proof principles in the $\lambda$calculus presented with first0rder abstract syntax over onesorted variable names. As well as summarising and elaborating on earlier, formally verified proofs (in $\mathrm{I}\mathrm{s ..."
Abstract
 Add to MetaCart
Abstract. We consider formal provability with structural induction and related proof principles in the $\lambda$calculus presented with first0rder abstract syntax over onesorted variable names. As well as summarising and elaborating on earlier, formally verified proofs (in $\mathrm
Learning probabilistic relational models
 In IJCAI
, 1999
"... A large portion of realworld data is stored in commercial relational database systems. In contrast, most statistical learning methods work only with "flat " data representations. Thus, to apply these methods, we are forced to convert our data into a flat form, thereby losing much ..."
Abstract

Cited by 613 (30 self)
 Add to MetaCart
objects. Although PRMs are significantly more expressive than standard models, such as Bayesian networks, we show how to extend wellknown statistical methods for learning Bayesian networks to learn these models. We describe both parameter estimation and structure learning — the automatic induction
Proving Properties of Programs by Structural Induction
 Computer Journal
, 1969
"... This paper discusses the technique of structural induction for proving theorems about programs. This technique is closely related to recursion induction but makes use of the inductive definition of the data structures handled by the programs. It treats programs with recursion but without assignments ..."
Abstract

Cited by 101 (0 self)
 Add to MetaCart
This paper discusses the technique of structural induction for proving theorems about programs. This technique is closely related to recursion induction but makes use of the inductive definition of the data structures handled by the programs. It treats programs with recursion but without
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 730 (21 self)
 Add to MetaCart
approaches such as the DavisPutnam procedure or resolution. We also show that GSAT can solve structured satisfiability problems quickly. In particular, we solve encodings of graph coloring problems, Nqueens, and Boolean induction. General application strategies and limitations of the approach are also
Structural induction in institutions
 Information and Computation
"... We develop a general logicindependent structural induction proof method at the level of abstract institutions. This provides a solid and uniform mathematical foundations to induction proof methodologies for a wide variety of actual logicbased formal specification frameworks. Our development is bas ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We develop a general logicindependent structural induction proof method at the level of abstract institutions. This provides a solid and uniform mathematical foundations to induction proof methodologies for a wide variety of actual logicbased formal specification frameworks. Our development
Generic structural induction
"... Abstract. System F supports induction over data types in a manner that is polymorphic with respect to the data held in the structure. Reduction is strongly normalising, so that operations on data always terminate. However, since the induction principles are encoded in the types, it is unable to expr ..."
Abstract
 Add to MetaCart
Abstract. System F supports induction over data types in a manner that is polymorphic with respect to the data held in the structure. Reduction is strongly normalising, so that operations on data always terminate. However, since the induction principles are encoded in the types, it is unable
An Algebraic View of Structural Induction
 Computer Science Logic 1994, number 933 in Lect. Notes Comp. Sci
, 1994
"... We propose a uniform, categorytheoretic account of structural induction for inductively defined data types. The account is based on the understanding of inductively defined data types as initial algebras for certain kind of endofunctors T : B !B on a bicartesian/distributive category B . Regarding ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
We propose a uniform, categorytheoretic account of structural induction for inductively defined data types. The account is based on the understanding of inductively defined data types as initial algebras for certain kind of endofunctors T : B !B on a bicartesian/distributive category B . Regarding
Mechanizing structural induction
 Theor. Comput. Sci
, 1979
"... This thesis has been submitted in fulfilment of the requirements for a postgraduate degree (e.g. PhD, MPhil, DClinPsychol) at the University of Edinburgh. Please note the following terms and conditions of use: • This work is protected by copyright and other intellectual property rights, which are re ..."
Abstract

Cited by 42 (0 self)
 Add to MetaCart
This thesis has been submitted in fulfilment of the requirements for a postgraduate degree (e.g. PhD, MPhil, DClinPsychol) at the University of Edinburgh. Please note the following terms and conditions of use: • This work is protected by copyright and other intellectual property rights, which are retained by the thesis author, unless otherwise stated. • A copy can be downloaded for personal noncommercial research or study, without prior permission or charge. • This thesis cannot be reproduced or quoted extensively from without first obtaining permission in writing from the author. • The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the author. • When referring to this work, full bibliographic details including the author, title,
Formal Studies of Structural Induction
, 2000
"... . Recursive definitions and the associated inductive proofs are well established in mathematics and computer science. The term "structural induction" is used to describe inductive proof steps over recursively defined structures. In this paper we state and prove, using the Z notation and th ..."
Abstract
 Add to MetaCart
. Recursive definitions and the associated inductive proofs are well established in mathematics and computer science. The term "structural induction" is used to describe inductive proof steps over recursively defined structures. In this paper we state and prove, using the Z notation
Results 1  10
of
6,617