Results 1  10
of
1,760
Lean Induction Principles for Tableaux
, 1997
"... . In this paper, we deal with various induction principles incorporated in an underlying tableau calculus with equality. The induction formulae are restricted to literals. Induction is formalized as modified closure conditions which are triggered by applications of the ffirule. Examples dealing wit ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
. In this paper, we deal with various induction principles incorporated in an underlying tableau calculus with equality. The induction formulae are restricted to literals. Induction is formalized as modified closure conditions which are triggered by applications of the ffirule. Examples dealing
A Computational Induction Principle
, 1991
"... It is critical to have an induction method for reasoning about recursive programs expressed as fixed points, for otherwise our reasoning ability is severely impaired. The fixed point induction rule developed by deBakker and Scott is one such well known principle. Here we propose a new induction meth ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
It is critical to have an induction method for reasoning about recursive programs expressed as fixed points, for otherwise our reasoning ability is severely impaired. The fixed point induction rule developed by deBakker and Scott is one such well known principle. Here we propose a new induction
Modal Logic and the Approximation Induction Principle
"... We prove a compactness theorem in the context of Hennessy–Milner logic. It is used to derive a sufficient condition on modal characterizations for the Approximation Induction Principle to be sound modulo the corresponding process equivalence. We show that this condition is necessary when the equival ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We prove a compactness theorem in the context of Hennessy–Milner logic. It is used to derive a sufficient condition on modal characterizations for the Approximation Induction Principle to be sound modulo the corresponding process equivalence. We show that this condition is necessary when
An Induction Principle for Pure Type Systems
, 2000
"... We present an induction principle for Pure Type Systems and use that principle to dene CPS translations and to solve the problem of Expansion Postponement for a large class of Pure Type Systems. Our principle strengthens and generalises similar principles by Dowek, Huet and Werner [12] and Barthe, H ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We present an induction principle for Pure Type Systems and use that principle to dene CPS translations and to solve the problem of Expansion Postponement for a large class of Pure Type Systems. Our principle strengthens and generalises similar principles by Dowek, Huet and Werner [12] and Barthe
Inductive Principles for Learning from Data
"... Face detection/recognition applications involve illdefined concepts (such as 'face' or 'person') that cannot be specified a priori in terms of a small set of features. This implies the need for learning unknown class decision boundaries from data (i.e., images with known class l ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, most approaches are heuristic, due to inherent complexity of estimation with finite data, and the lack of conceptual framework. This paper describes several principled approaches (called inductive principles) for estimating dependencies from data. The focus is on the general conceptual framework
AN INDUCTION PRINCIPLE AND PIGEONHOLE PRINCIPLES FOR KFINITE SETS
, 1994
"... Abstract. We establish a courseofvalues induction principle for Kfinite sets in intuitionistic type theory. Using this principle, we prove a pigeonhole principle conjectured by Bénabou and Loiseau. We also comment on some variants of this pigeonhole principle. 1. ..."
Abstract
 Add to MetaCart
Abstract. We establish a courseofvalues induction principle for Kfinite sets in intuitionistic type theory. Using this principle, we prove a pigeonhole principle conjectured by Bénabou and Loiseau. We also comment on some variants of this pigeonhole principle. 1.
A Coinduction Principle for Recursively Defined Domains
 THEORETICAL COMPUTER SCIENCE
, 1992
"... This paper establishes a new property of predomains recursively defined using the cartesian product, disjoint union, partial function space and convex powerdomain constructors. We prove that the partial order on such a recursive predomain D is the greatest fixed point of a certain monotone operator ..."
Abstract

Cited by 43 (3 self)
 Add to MetaCart
of the proof principles is independent of any of the various methods available for explicit construction of recursive predomains. Following Milner and Tofte [10], the method of proof is called coinduction. It closely resembles the way bisimulations are used in concurrent process calculi [9]. Two specific
Induction principles formalized in the Calculus of Constructions
 Programming of Future Generation Computers. Elsevier Science
, 1988
"... The Calculus of Constructions is a higherorder formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard [12], MartinLöf [14] and Scott [18]. The calculus and its syntactic theory were presented in Coquand’s thesis [7], and an implementa ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
specifications. The current paper shows how to define inductive concepts in the calculus. A very general induction schema is obtained by postulating all elements of the type of interest to belong to the standard interpretation associated with a predicate map. This is similar to the treatment of D. Park [16
Results 1  10
of
1,760