Hans Kleine Büning – författare
Visar alla böcker från författaren Hans Kleine Büning. Handla med fri frakt och snabb leverans.
9 produkter
9 produkter
380 kr
Skickas inom 3-6 vardagar
500 kr
Skickas inom 10-15 vardagar
Die Programmiersprache PROLOG hat in den letzten Jahren, nicht zuletzt durch zahl reiche Anwendungen im Bereich der Expertensysteme und der natürlichsprachlichen Ver arbeitung, immer mehr an Bedeutung gewonnen. Gegenüber prozeduralen Programmier sprachen, wie z.B. Pascal, in denen Verfahren zur Lösung eines Problems programmiert werden müssen, besteht Programmieren in PROLOG im Prinzip aus einer Beschreibung des Problems. Daraus ergeben sich natürlich ganz andere Methoden und Schwierigkeiten beim Entwurf eines Programms. Dieses Buch ist aus Vorlesungen an der Universität Karlsruhe entstanden. Aus den dabei gemachten Erfahrungen resultiert auch der Aufbau des Buches. Zuerst werden einfache Programme und Konstrukte in Prolog vorgestellt, um den Leser mit der Vorgehensweise bei der Programmierung in PROLOG vertraut zu machen. Nach einem Exkurs über Grundlagen der Logik schließt sich ein Kapitel über die Syntax der Sprache an, wobei wir uns an der Syntax von C-Prolog orientiert haben. Bevor dann eine ausführliche Darstellung der wichtigsten Built-in-Prädikate mit Beispielen stattfindet, wird auf den Ablauf bei der Lösungssuche in PROLOG eingegangen. Die Anwendungen sind in zwei Bereiche aufgeteilt. Zum einen werden relativ kurze Bei spiele über Mengen, Parser, Spiele, Logik und Mathematik vorgestellt und zum anderen ist den Expertensystemen ein ganzes Kapitel gewidmet. Hierbei geht es weniger um eine Vorstellung und allgemeine Diskussion solcher Systeme, sondern um die Entwick lung einer Shell für die Implementation von Expertensystemen. Im Anha.ng befindet sich dann, bis auf ein Modul für die Wissenserfassung, das vollständige Programm für diese Entwicklungsumgebung.
CSL '87
1st Workshop on Computer Science Logic, Karlsruhe, FRG, October 12-16, 1987. Proceedings
Häftad, Engelska, 1988
550 kr
Skickas inom 10-15 vardagar
This volume contains the papers which were presented to the workshop "Computer-Science Logic" held in Karlsruhe on October 12-16, 1987. Traditionally Logic, or more specifically, Mathematical Logic splits into several subareas: Set Theory, Proof Theory, Recursion Theory, and Model Theory. In addition there is what sometimes is called Philosophical Logic which deals with topics like nonclassical logics and which for historical reasons has been developed mainly at philosphical departments rather than at mathematics institutions. Today Computer Science challenges Logic in a new way. The theoretical analysis of problems in Computer Science for intrinsic reasons has pointed back to Logic. A broad class of questions became visible which is of a basically logical nature. These questions are often related to some of the traditional disciplines of Logic but normally without being covered adequately by any of them. The novel and unifying aspect of this new branch of Logic is the algorithmic point of view which is based on experiences people had with computers. The aim of the "Computer-Science Logic" workshop and of this volume is to represent the richness of research activities in this field in the German-speaking countries and to point to their underlying general logical principles.
CSL'88
2nd Workshop on Computer Science Logic, Duisburg, FRG, October 3-7, 1988. Proceedings
Häftad, Engelska, 1989
534 kr
Skickas inom 10-15 vardagar
This volume contains the papers which were presented at the second workshop "Computer Science Logic" held in Duisburg, FRG, October 3-7, 1988. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers deal with problems arising at the border of logic and computer science: e.g. in complexity, data base theory, logic programming, artificial intelligence, and concurrency. The volume should be of interest to all logicians and computer scientists working in the above fields.
CSL '89
3rd Workshop on Computer Science Logic. Kaiserslautern, FRG, October 2-6, 1989. Proceedings
Häftad, Engelska, 1990
550 kr
Skickas inom 10-15 vardagar
This volume contains the revised versions of 28 papers presented at the third workshop on Computer Science Logic held in Kaiserslautern, FRG, October 2-6, 1989. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers deal with problems arising at the border of logic and computer science, e.g. in complexity, data base theory, logic programming, artificial intelligece, and temporal logic. The volume should be of interest to all logicians and computer scientists working in the above field.
Computer Science Logic
4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990. Proceedings
Häftad, Engelska, 1991
534 kr
Skickas inom 10-15 vardagar
The workshop Computer Science Logic '90 was held at theMax-Planck-Haus in Heidelberg, Germany, October 1-5, 1990. It was the fourth in a series of worskhops, following CSL'89 at the University of Kaiserslautern (see LNCS 440), CSL'88 at the University of Duisberg (see LNCS 385), and CSL'87 at the University of Karlsruhe (see LNCS 329). Thisvolume contains 24 papers, chosen by means of a reviewprocedure from the 35 papers presented at the workshop, someof which were invited and some selected from a total of 89submissions. The papers cover a wide range of topics arisingfrom the applications of logic to computer science.
Computer Science Logic
5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991. Proceedings
Häftad, Engelska, 1992
534 kr
Skickas inom 10-15 vardagar
This volume presents the proceedings of the workshop CSL '91(Computer Science Logic) held at the University of Berne,Switzerland, October 7-11, 1991. This was the fifth in aseries of annual workshops on computer sciencelogic (thefirst four are recorded in LNCS volumes 329, 385, 440, and533). The volume contains 33 invited and selected papers on avariety of logical topics in computer science, includingabstract datatypes, bounded theories, complexity results,cut elimination, denotational semantics, infinitary queries,Kleene algebra with recursion, minimal proofs, normal formsin infinite-valued logic, ordinal processes, persistentPetri nets, plausibility logic, program synthesis systems,quantifier hierarchies, semantics of modularization, stablelogic, term rewriting systems, termination of logicprograms, transitive closure logic, variants of resolution,and many others.
Computer Science Logic
6th Workshop, CSL'92, San Miniato, Italy, September 28 - October 2, 1992. Selected Papers
Häftad, Engelska, 1993
534 kr
Skickas inom 10-15 vardagar
This volume presents the proceedings of the Computer ScienceLogic Workshop CSL '92, held in Pisa, Italy, inSeptember/October 1992. CSL '92 was the sixth of the seriesand the first one held as Annual Conference of the EuropeanAssociation for Computer Science Logic (EACSL). Fullversions of the workshop contributions were collected aftertheir presentation and reviewed. On the basis of 58 reviews,26 papers were selected for publication, and appear here inrevised final form. Topics covered in the volume include: Turing machines,linear logic, logic of proofs, optimization problems, lambdacalculus, fixpoint logic, NP-completeness, resolution,transition system semantics, higher order partial functions,evolving algebras, functional logic programming, inductivedefinability, semantics of C, classes for a functionallanguage, NP-optimization problems, theory of types andnames, sconing and relators, 3-satisfiability, Kleene'sslash, negation-complete logic programs, polynomial-timeoracle machines, and monadic second-order properties.
Theory and Applications of Satisfiability Testing – SAT 2008
11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008, Proceedings
Häftad, Engelska, 2008
534 kr
Skickas inom 10-15 vardagar
This volume contains the papers presented at the 11th International Conference on Theory and Applications of Satis?ability Testing (SAT 2008). The series of International Conferences on Theory and Applications of S- is?ability Testing (SAT) has evolved from a ?rst workshop on SAT in 1996 to an annual international conference which is a platform for researchers studying various aspects of the propositional satis?ability problem and its applications. In the past, the SAT conference venue alternated between Europe and North America. For the ?rst time, the conference venue was in Asia, more precisely at the Zhudao Guest House, near Sun Yat-Sen University in Guangzhou, P. R. China. Many hard combinatorial problems can be encoded into SAT. Therefore - provementsonheuristics onthe practicalside,as wellastheoreticalinsightsinto SAT apply to a large range of real-world problems. More speci?cally, many - portant practical veri?cation problems can be rephrased as SAT problems. This applies to veri?cation problems in hardware and software. Thus SAT is bec- ing one of the most important core technologies to verify secure and dependable systems. The topics of the conference span practical and theoretical research on SAT and its applications and include but are not limited to proof systems, proof complexity, search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, s- pli?ers, tools, case studies, and empirical results. SAT is interpreted in a rather broad sense: besides propositional satis?ability, it includes, for example, the - main of quanti?ed Boolean formulae (QBF) and satis?ability modulo theories (SMT).