Bibel

Mathematical Methods of Specification and Synthesis of Software Systems '85

Proceedings of the International Spring School Wendisch-Rietz, GDR, April 22-26, 1985
Mitarbeit:Bibel, Wolfgang; Jantke, Klaus P.

• Broschiertes Buch

Produktbeschreibung

Verification of an alternating bit protocol by means of process algebra protocol.- Predicative programming revisited.- Some problems on inductive inference from positive data.- Language and example of knowledge-based programming.- Inductive inference hierarchies: Probabilistic VS pluralistic strategies.- Natural mathematical texts VS. programs.- An algebraic framework for inductive program synthesis.- Approximation logic.- Learning on the basis of a polynomial pattern synthesis algorithm.- The proof-checking component for the pleats programming system enabling specification of theories.- The METANET. A knowledge representation tool based on abstract data types.- One more property of array languages.- Theoretical aspects of ?-programming.- Decidability in pratt's process logics.- A program synthesis algorithm exemplified.- The algorithmic specification method of abstract data types: An overview.- Orientation problems on sequences by recursive functions.- The solution of discrete problems by means of ternary representations.- Formalizing analogical reasoning.- Some results in the theory of effective program synthesis: Learning by defective information.- Deductive normal forms of relations.- How fast is program synthesis from examples.- On recursive optimizers.

Produktdetails

• Lecture Notes in Computer Science 215
• Verlag: Springer, Berlin
• 1985.
• Seitenzahl: 256
• Erscheinungstermin: 1. Juni 1986
• Englisch
• Abmessung: 235mm x 155mm x 15mm
• Gewicht: 394g
• ISBN-13: 9783540164449
• ISBN-10: 3540164448
• Artikelnr.: 09218052

Autorenporträt

Prof. Dr. Wolfgang Bibel lehrt das Fachgebiet Intellektik am Fachbereich Informatik der TH Darmstadt.

Inhaltsangabe

Verification of an alternating bit protocol by means of process algebra protocol.- Predicative programming revisited.- Some problems on inductive inference from positive data.- Language and example of knowledge-based programming.- Inductive inference hierarchies: Probabilistic VS pluralistic strategies.- Natural mathematical texts VS. programs.- An algebraic framework for inductive program synthesis.- Approximation logic.- Learning on the basis of a polynomial pattern synthesis algorithm.- The proof-checking component for the pleats programming system enabling specification of theories.- The METANET. A knowledge representation tool based on abstract data types.- One more property of array languages.- Theoretical aspects of ?-programming.- Decidability in pratt's process logics.- A program synthesis algorithm exemplified.- The algorithmic specification method of abstract data types: An overview.- Orientation problems on sequences by recursive functions.- The solution of discrete problems by means of ternary representations.- Formalizing analogical reasoning.- Some results in the theory of effective program synthesis: Learning by defective information.- Deductive normal forms of relations.- How fast is program synthesis from examples.- On recursive optimizers.