Mathematical Methods of Specification and Synthesis of Software Systems '85

Proceedings of the International Spring School Wendisch-Rietz, GDR, April 22-26, 1985

AvWolfgang Bibel,Klaus P. Jantke

Häftad, Engelska, 1986

Del i serien Lecture Notes in Computer Science

572 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1986-06-01
Mått:216 x 279 x 15 mm
Vikt:394 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:248
Upplaga:1986
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540164449

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT

Innehållsförteckning

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.

Du kanske också är intresserad av

Mathematical Methods of Specification and Synthesis of Software Systems '85

Klaus P. Jantke, Wolfgang Bibel

E-bok

1987

1 775 kr

Del 31

Mathematical Methods of Specification and Synthesis of Software Systems ‘85

Wolfgang Bibel, Klaus P. Jantke

Inbunden, 1986

2 046 kr

Nonmonotonic and Inductive Logic

Klaus P. Jantke, Peter H. Schmitt

Häftad, 1991

572 kr

Discovery Science

Nada Lavrač, Ljupco Todorovski, Klaus P. Jantke

Häftad, 2006

556 kr

Federation over the Web

Klaus P. Jantke, Aran Lunzer, Nicolas Spyratos, Yuzuru Tanaka

Häftad, 2006

572 kr

Algorithmic Learning Theory

Klaus P. Jantke, Shigenobu Kobayashi, Etsuji Tomita, Takashi Yokomori

Häftad, 1993

556 kr

Recent Trends in Data Type Specification

Hartmut Ehrig, Klaus P. Jantke, Fernando Orejas, Horst Reichel

Häftad, 1991

572 kr

Federation over the Web

Yuzuru Tanaka, Nicolas Spyratos, Aran Lunzer, Klaus P. Jantke

E-bok

2005

739 kr

Grundlagen der Künstlichen Intelligenz

Helmut Thiele, Klaus P. Jantke, Jan Grabowski

E-bok

1989

1 775 kr

Analogical and Inductive Inference

Klaus P. Jantke

Häftad, 1989

572 kr

Mathematical Methods of Specification and Synthesis of Software Systems '85

Proceedings of the International Spring School Wendisch-Rietz, GDR, April 22-26, 1985

AvWolfgang Bibel,Klaus P. Jantke

Häftad, Engelska, 1986

Del i serien Lecture Notes in Computer Science

572 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1986-06-01
Mått:216 x 279 x 15 mm
Vikt:394 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:248
Upplaga:1986
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540164449

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT

Innehållsförteckning

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.