Computer Science Logic 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings - neues Buch

EAN (ISBN-13): 9783540454588
ISBN (ISBN-10): 3540454586
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2006
Herausgeber: Springer Berlin Heidelberg
644 Seiten
Gewicht: 0,959 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-05-10T20:52:11+02:00 (Vienna)
Detailseite zuletzt geändert am 2024-03-11T18:01:35+01:00 (Vienna)
ISBN/EAN: 9783540454588

ISBN - alternative Schreibweisen:
3-540-45458-6, 978-3-540-45458-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: isik
Titel des Buches: international conference computer science, september issue, logic computer science, the szeged conference, international conference proceedings

---

Daten vom Verlag:

Autor/in: Zoltán Ésik
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Computer Science Logic - 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings
Verlag: Springer; Springer Berlin
627 Seiten
Erscheinungsjahr: 2006-09-20
Berlin; Heidelberg; DE
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XII, 627 p.

BC; Hardcover, Softcover / Informatik, EDV/Programmiersprachen; Compiler und Übersetzer; Verstehen; Informatik; AI logics; Action; Constraint; classical logic; complexity; computational logic; finite models; higher order logic; linear logic; logic; logic programming; mathematical logic; model checking; nonclassical logic; permutative logic; Compilers and Interpreters; Theory of Computation; Formal Languages and Automata Theory; Artificial Intelligence; Computer Science Logic and Foundations of Programming; Mathematical Logic and Foundations; Theoretische Informatik; Künstliche Intelligenz; Mathematik: Logik; Mathematische Grundlagen; EA

Invited Presentations.- Functorial Boxes in String Diagrams.- Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract).- Automata and Logics for Words and Trees over an Infinite Alphabet.- Nonmonotonic Logics and Their Algebraic Foundations.- Contributions.- Semi-continuous Sized Types and Termination.- Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation.- A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata.- The Power of Linear Functions.- Logical Omniscience Via Proof Complexity.- Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic.- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay.- Abstracting Allocation.- Collapsibility in Infinite-Domain Quantified Constraint Satisfaction.- Towards an Implicit Characterization of NC k .- On Rational Trees.- Reasoning About States of Probabilistic Sequential Programs.- Concurrent Games with Tail Objectives.- Nash Equilibrium for Upward-Closed Objectives.- Algorithms for Omega-Regular Games with Imperfect Information.- Relating Two Standard Notions of Secrecy.- Jump from Parallel to Sequential Proofs: Multiplicatives.- First-Order Queries over One Unary Function.- Infinite State Model-Checking of Propositional Dynamic Logics.- Weak Bisimulation Approximants.- Complete Problems for Higher Order Logics.- Solving Games Without Determinization.- Game Quantification on Automatic Structures and Hierarchical Model Checking Games.- An Algebraic Point of View on the Crane Beach Property.- A Sequent Calculus for Type Theory.- Universality Results for Models in Locally Boolean Domains.- Universal Structures and the Logic of Forbidden Patterns.- On the Expressive Power ofGraph Logic.- Hoare Logic in the Abstract.- Normalization of IZF with Replacement.- Acyclicity and Coherence in Multiplicative Exponential Linear Logic.- Church Synthesis Problem with Parameters.- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates.- Separation Logic for Higher-Order Store.- Satisfiability and Finite Model Property for the Alternating-Time ?-Calculus.- Space-Efficient Computation by Interaction.- The Ackermann Award 2006.