Computer Science Logic (Lecture Notes in Computer Science) de Egon Börger

Computer Science Logic: 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991. Proceedings: Lecture Notes in Computer Science, cartea 626

Egon Börger

Gerhard Jäger

Hans Kleine Büning

Michael M. Richter

en Limba Engleză Paperback – 10 sep 1992

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.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 1061^.55 lei
20%

Preț: 307^.71 lei
20%

Preț: 438^.69 lei
20%

Preț: 579^.30 lei
Preț: 410^.88 lei
17%

Preț: 427^.22 lei
20%

Preț: 596^.46 lei
15%

Preț: 448^.04 lei
20%

Preț: 353^.50 lei
Preț: 389^.49 lei
20%

Preț: 309^.90 lei
20%

Preț: 645^.28 lei
20%

Preț: 763^.23 lei
15%

Preț: 580^.46 lei
20%

Preț: 310^.28 lei
20%

Preț: 655^.02 lei
20%

Preț: 1183^.14 lei
20%

Preț: 340^.32 lei
Preț: 449^.57 lei
20%

Preț: 591^.51 lei
18%

Preț: 938^.83 lei
20%

Preț: 337^.00 lei
20%

Preț: 649^.50 lei
20%

Preț: 607^.40 lei
20%

Preț: 1414^.79 lei
20%

Preț: 1024^.44 lei
20%

Preț: 583^.40 lei
20%

Preț: 453^.32 lei
20%

Preț: 575^.49 lei
20%

Preț: 1075^.26 lei
20%

Preț: 585^.88 lei
20%

Preț: 825^.93 lei
17%

Preț: 360^.20 lei
20%

Preț: 763^.23 lei
20%

Preț: 340^.32 lei
20%

Preț: 504^.58 lei
20%

Preț: 369^.13 lei
20%

Preț: 580^.93 lei
20%

Preț: 343^.62 lei
20%

Preț: 350^.21 lei
20%

Preț: 583^.40 lei
20%

Preț: 583^.40 lei
15%

Preț: 438^.59 lei
20%

Preț: 341^.95 lei
20%

Preț: 238^.01 lei
20%

Preț: 538^.30 lei

Cuprins

The expressive power of transitive closure and 2-way multihead automata.- Correctness proof for the WAM with types.- Model checking of persistent Petri nets.- Provability in TBLL: A decision procedure.- How to implement first order formulas in local memory machine models.- A new approach to abstract data types II computation on ADTs as ordinary computation.- A primitive recursive set theory and AFA: On the logical complexity of the largest bisimulation.- On bounded theories.- The cutting plane proof system with bounded degree of falsity.- Denotational versus declarative semantics for functional programming.- On transitive closure logic.- Some aspects of the probabilistic behavior of variants of resolution.- Safe queries in relational databases with functions.- Logical inference and polyhedral projection.- Stable logic.- A transformational methodology for proving termination of logic programs.- Plausibility logic.- Towards Kleene Algebra with recursion.- Equational specification of abstract types and combinators.- Normal forms in infinite-valued logic: The case of one variable.- A fragment of first order logic adequate for observation equivalence.- Ordinal processes in comparative concurrency semantics.- Logical semantics of modularisation.- A cut-elimination procedure designed for evaluating proofs as programs.- Minimal from classical proofs.- Quantifier hierarchies over word relations.- Complexity results for the default- and the autoepistemic logic.- On Completeness for NP via projection translations.- Control of ?-automata, Church's problem, and the emptiness problem for tree ?-automata.- Comparing the theory of representations and constructive mathematics.- Infinitary queries and their asymptotic probabilities I: Properties definable in transitive closure logic.-On completeness of program synthesis systems.- Proving termination for term rewriting systems.