Geschäftskunden Kundenprogramme

KI-Beratung Beta
Vor Ort
Merkzettel Warenkorb
  • Produktbild: Computer Science Logic
  • Produktbild: Computer Science Logic
Band 626

Computer Science Logic 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991. Proceedings

Aus der Reihe Lecture Notes in Computer Science

Fr. 72.90

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

10.09.1992

Abbildungen

VIII, 431 p.

Herausgeber

Egon Börger + weitere

Verlag

Springer Berlin

Seitenzahl

431

Maße (L/B/H)

23.5/15.5/2.4 cm

Gewicht

663 g

Auflage

1992

Sprache

Englisch

ISBN

978-3-540-55789-0

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

10.09.1992

Abbildungen

VIII, 431 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

431

Maße (L/B/H)

23.5/15.5/2.4 cm

Gewicht

663 g

Auflage

1992

Sprache

Englisch

ISBN

978-3-540-55789-0

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Computer Science Logic
  • Produktbild: Computer Science Logic
  • 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.