Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMMSSS 1985: Wendisch-Rietz, GDR
- Wolfgang Bibel, Klaus P. Jantke:
Mathematical Methods of Specification and Synthesis of Software Systems '85, Proceedings of the International Spring School, Wendisch-Rietz, GDR, April 22-26, 1985. Lecture Notes in Computer Science 215, Springer 1986, ISBN 3-540-16444-8
Lectures
- Jan A. Bergstra, Jan Willem Klop:
Verification of an alternating bit protocol by means of process algebra. 9-23 - Wolfgang Bibel:
Predicative programming revisited. 25-40 - Takeshi Shinohara:
Some problems on inductive inference from positive data. 41-58 - Enn Tyugu:
Language and example of knowledge-based programming. 59-72 - Robert P. Daley:
Inductive inference hierarchies: probabilistic vs pluralistic strategies. 73-82 - Tamás Gergely, Konstantin Vershinin:
Natural mathematical texts vs. programs. 83-100 - Klaus P. Jantke:
An algebraic framework for inductive program synthesis. 101-122 - Helena Rasiowa, Andrzej Skowron
:
Approximation logic. 123-139
Contributed Papers
- Ognian Botusharov:
Learning on the basis of a polynomial pattern synthesis algorithm. 141-148 - Jolanta Cybulka, Jerzy Bartoszek:
The proof-checking component for the PLEATS programming system enabling specification of theories. 149-155 - Werner Dilger, Wolfgang Womann:
The METANET. A knowledge representation tool based on abstract data types. 156-161 - Marek Ejsmont:
One more property of array languages. 162-168 - Sergei S. Goncharov, Dmitri Ivanovich Sviridenko:
Theoretical aspects of Sigma-programming. 169-179 - Zdzislaw Habasinski:
Decidability in Pratt's process logics. 180-184 - Steffen Lange:
A program synthesis algorithm exemplified. 185-193 - Jacques Loeckx:
The algorithmic specification method of abstract data types: an overview. 194-200 - Péter Komjáth, Zsolt Mihály Szabó:
Orientation problems on sequences by recursive functions. 201-206 - Christian Posthoff, Joachim Reiß:
The solution of discrete problems by means of ternary representation. 207-214 - Dieter Pötschke:
Formalizing analogical reasoning. 215-218 - Gisela Schäfer:
Some results in the theory of effective program synthesis: learning by defective information. 219-225 - Bernhard Thalheim:
Deductive normal forms of relations. 226-230 - Rolf Wiehagen:
How fast is program synthesis from examples. 231-239 - Thomas Zeugmann:
On recursive optimizers. 240-245
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-10 21:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
