Börger

Computer Science Logic

6th Workshop, CSL'92, San Miniato, Italy, September 28 - October 2, 1992. Selected Papers
Mitarbeit:Börger, Egon; Jäger, Gerhard; Kleine-Büning, Hans

• Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• Lecture Notes in Computer Science 702
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-56992-3
• 1993.
• Seitenzahl: 456
• Erscheinungstermin: 11. August 1993
• Englisch
• Abmessung: 235mm x 155mm x 25mm
• Gewicht: 600g
• ISBN-13: 9783540569923
• ISBN-10: 3540569928
• Artikelnr.: 09223111

Autorenporträt

Egon Börger ist Professor für Informatik an der Universität Pisa (Italien) und Alexander-von-Humboldt-Forschungspreisträger.

Inhaltsangabe

A universal Turing machine.- Recursive inseparability in linear logic.- The basic logic of proofs.- Algorithmic structuring of cut-free proofs.- Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions.- Linear ?-calculus and categorical models revisited.- A self-interpreter of lambda calculus having a normal form.- An "Ehrenfeucht-Fraïssé game" for fixpoint logic and stratified fixpoint logic.- The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness.- Model building by resolution.- Comparative transition system semantics.- Reasoning with higher order partial functions.- Communicating evolving algebras.- On the completeness of narrowing as the operational semantics of functional logic programming.- Inductive definability with counting on finite structures.- Linear time algorithms and NP-complete problems.- The semantics of the C programming language.- A theory of classes for a functional language with effects.- Logical definability of NP-optimisation problems with monadic auxiliary predicates.- Universes in the theories of types and names.- Notes on sconing and relators.- Solving 3-satisfiability in less than 1, 579n steps.- Kleene's slash and existence of values of open terms in type theory.- Negation-complete logic programs.- Logical characterization of bounded query classes II: Polynomial-time oracle machines.- On asymptotic probabilities of monadic second order properties.