Inductive programming is concerned with the automated construction of decl- ative-often functional -recursiveprogramsfromincompletespeci?cationssuch as input/output examples. The inferred program must be correct with respect to the provided examples in a generalizing sense: it should be neither equivalent to it, nor inconsistent. Inductive programming algorithms are guided explicitly or implicitly by a language bias (the class of programs that can be induced) and a search bias (determining which generalized program is constructed ?rst). Induction strategiesare either generate-and-testor example-driven.In genera- and-test approaches, hypotheses about candidate programs are generated in- pendently from the given speci?cations. Program candidates are tested against the given speci?cation and one or more of the best evaluated candidates are - veloped further. In analytical approaches, candidate programs are constructed in an example-driven way. While generate-and-test approaches can - in prin- ple - construct any kind of program, analytical approaches have a more limited scope. On the other hand, e?ciency of induction is much higher in analytical approaches. Inductive programming is still mainly a topic of basic research, exploring how the intellectual ability of humans to infer generalized recursive procedures from incomplete evidence can be captured in the form of synthesis methods. Intended applications are mainly in the domain of programming assistance - either to relieve professional programmers from routine tasks or to enable n- programmers to some limited form of end-user programming. Furthermore, in future, inductiveprogrammingtechniquesmightbe appliedtofurtherareassuch as support inference of lemmata in theorem proving or learning grammar rules.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
EUR 9,90 expédition depuis Allemagne vers France
Destinations, frais et délaisEUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisVendeur : Buchpark, Trebbin, Allemagne
Etat : Sehr gut. Zustand: Sehr gut | Seiten: 208 | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 6962610/12
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. State of the art researchFast track conference proceedingsRepresentative selection of current researchInvited Papers.- Deriving a Relationship from a Single Example.- Synthesis of Functions Using Generic Programming.- Regular Papers.- Inductive Programm. N° de réf. du vendeur 5049707
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Inductive programming is concerned with the automated construction of decl- ative often functional recursiveprogramsfromincompletespeci cationssuch as input/output examples. The inferred program must be correct with respect to the provided examples in a generalizing sense: it should be neither equivalent to it, nor inconsistent. Inductive programming algorithms are guided explicitly or implicitly by a language bias (the class of programs that can be induced) and a search bias (determining which generalized program is constructed rst). Induction strategiesare either generate-and-testor example-driven.In genera- and-test approaches, hypotheses about candidate programs are generated in- pendently from the given speci cations. Program candidates are tested against the given speci cation and one or more of the best evaluated candidates are - veloped further. In analytical approaches, candidate programs are constructed in an example-driven way. While generate-and-test approaches can in prin- ple construct any kind of program, analytical approaches have a more limited scope. On the other hand, e ciency of induction is much higher in analytical approaches. Inductive programming is still mainly a topic of basic research, exploring how the intellectual ability of humans to infer generalized recursive procedures from incomplete evidence can be captured in the form of synthesis methods. Intended applications are mainly in the domain of programming assistance either to relieve professional programmers from routine tasks or to enable n- programmers to some limited form of end-user programming. Furthermore, in future,inductiveprogrammingtechniquesmightbe appliedtofurtherareassuch as support inference of lemmata in theorem proving or learning grammar rules. N° de réf. du vendeur 9783642119309
Quantité disponible : 1 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Inductive programming is concerned with the automated construction of decl- ative often functional recursiveprogramsfromincompletespeci cationssuch as input/output examples. The inferred program must be correct with respect to the provided examples in a generalizing sense: it should be neither equivalent to it, nor inconsistent. Inductive programming algorithms are guided explicitly or implicitly by a language bias (the class of programs that can be induced) and a search bias (determining which generalized program is constructed rst). Induction strategiesare either generate-and-testor example-driven.In genera- and-test approaches, hypotheses about candidate programs are generated in- pendently from the given speci cations. Program candidates are tested against the given speci cation and one or more of the best evaluated candidates are - veloped further. In analytical approaches, candidate programs are constructed in an example-driven way. While generate-and-test approaches can in prin- ple construct any kind of program, analytical approaches have a more limited scope. On the other hand, e ciency of induction is much higher in analytical approaches. Inductive programming is still mainly a topic of basic research, exploring how the intellectual ability of humans to infer generalized recursive procedures from incomplete evidence can be captured in the form of synthesis methods. Intended applications are mainly in the domain of programming assistance either to relieve professional programmers from routine tasks or to enable n- programmers to some limited form of end-user programming. Furthermore, in future,inductiveprogrammingtechniquesmightbe appliedtofurtherareassuch as support inference of lemmata in theorem proving or learning grammar rules. 208 pp. Englisch. N° de réf. du vendeur 9783642119309
Quantité disponible : 2 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. Neuware -Inductive programming is concerned with the automated construction of decl- ative¿often functional ¿recursiveprogramsfromincompletespeci cationssuch as input/output examples. The inferred program must be correct with respect to the provided examples in a generalizing sense: it should be neither equivalent to it, nor inconsistent. Inductive programming algorithms are guided explicitly or implicitly by a language bias (the class of programs that can be induced) and a search bias (determining which generalized program is constructed rst). Induction strategiesare either generate-and-testor example-driven.In genera- and-test approaches, hypotheses about candidate programs are generated in- pendently from the given speci cations. Program candidates are tested against the given speci cation and one or more of the best evaluated candidates are - veloped further. In analytical approaches, candidate programs are constructed in an example-driven way. While generate-and-test approaches can ¿ in prin- ple ¿ construct any kind of program, analytical approaches have a more limited scope. On the other hand, e ciency of induction is much higher in analytical approaches. Inductive programming is still mainly a topic of basic research, exploring how the intellectual ability of humans to infer generalized recursive procedures from incomplete evidence can be captured in the form of synthesis methods. Intended applications are mainly in the domain of programming assistance ¿ either to relieve professional programmers from routine tasks or to enable n- programmers to some limited form of end-user programming. Furthermore, in future,inductiveprogrammingtechniquesmightbe appliedtofurtherareassuch as support inference of lemmata in theorem proving or learning grammar rules.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 208 pp. Englisch. N° de réf. du vendeur 9783642119309
Quantité disponible : 2 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 9030949-n
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 9030949
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 9030949-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783642119309_new
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 9030949
Quantité disponible : Plus de 20 disponibles