Results 271 to 280 of about 9,309 (288)

Grammar Induction as Substructural Inductive Logic Programming

2000
In this chapter we describe an approach to grammar induction based on categorial grammars: the EMILE algorithm. Categorial grammars are equivalent to context-free grammars. They were introduced by Ajduciewicz and formalised by Lambek. Technically they can be seen as a variant of the propositional calculus without structural rules.
de Haas, E., Adriaans, P.W.
openaire   +3 more sources

Cautious induction in inductive logic programming

1997
Many top-down Inductive Logic Programming systems use a greedy, covering approach to construct hypotheses. This paper presents an alternative, cautious approach, known as cautious induction. We conjecture that cautious induction can allow better hypotheses to be found, with respect to some hypothesis quality criteria.
Simon Anthony, Alan M. Frisch
openaire   +2 more sources

Induction as the Basis for Program Verification

IEEE Transactions on Software Engineering, 1976
We will consider the inductive mechanisms in five techniques for verifying iterative/recursive program structures: inductive assertion, predicate transformers, subgoal induction, computation induction, and structural induction. We will discover that all five techniques can be justified by a single theorem about inductive proof techniques.
Charles W. Reynolds, Raymond T. Yeh
openaire   +4 more sources

The case for inductive programming

Computer, 1997
The science of creating software is based on deductive methods, but induction-deduction's ignored sibling-could have a profound effect on the future development of computer science theory and practice. Inductive reasoning can solve problems outside the realm of machine learning.
openaire   +1 more source

The Effectiveness of Induction Programs

Kappa Delta Pi Record, 1989
(1989). The Effectiveness of Induction Programs. Kappa Delta Pi Record: Vol. 25, No. 4, pp. 117-119.
openaire   +2 more sources

Integrating induction and abduction in logic programming [PDF]

Information Sciences, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LAMMA, Evelina, MELLO, Paola, MILANO, Michela, RIGUZZI, Fabrizio   +3 more
openaire   +3 more sources

Inductive methods for proving properties of programs

ACM SIGPLAN Notices, 1972
We have two main purposes in this paper. First, we clarify and extend known results about computation of recursive programs, emphasizing the difference between the theoretical and practical approaches. Secondly, we present and examine various known methods for proving properties of recursive programs. We discuss in detail two powerful inductive methods,
Jean Vuillemin, Zohar Manna, Stephen Ness   +2 more
openaire   +4 more sources

Phonotactics in Inductive Logic Programming

2004
We examine the results of applying inductive logic programming (ILP) to a relatively simple linguistic task, that of recognizing monosyllables in one language. ILP is suited to linguistic problems given linguists' preference for formulating their theories in discrete rules, and because of ILP's ability to incorporate various background theories. But it
John Nerbonne, Stasinos Konstantopoulos
openaire   +3 more sources

Inductive logic programming

New Generation Computing, 1991
A new research area, Inductive Logic Programming, is presently emerging. While inheriting various positive characteristics of the parent subjects of Logic Programming and Machine Learning, it is hoped that the new area will overcome many of the limitations of its forebears.
openaire   +2 more sources

Programming with Inductive and Co-Inductive Types

1992
We look at programming with inductive and co-inductive datatypes, which are inspired theoretically by initial algebras and final co-algebras, respectively. A predicative calculus which incorporates these datatypes as primitive constructs is presented. This calculus allows reduction sequences which are significantly more efficient for two dual classes ...
openaire   +2 more sources