Logic, Language, Information and Computation 15th International Workshop, WoLLIC 2008 Edinburgh, UK, July 1-4, 2008 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Hodges, Wilfrid (Επιμελητής έκδοσης), Queiroz, Ruy de (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Lecture Notes in Computer Science, 5110
• Θέματα: Philosophy.; Logic.; Computer programming.; Computers.; Algorithms.; Mathematical logic.; Artificial intelligence.; Artificial Intelligence (incl. Robotics).; Programming Techniques.; Theory of Computation.; Algorithm Analysis and Problem Complexity.; Mathematical Logic and Formal Languages.

Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the 4th volume of the FoLLI LNAI subline; containing the refereed proceedings of the 15th International Workshop on Logic, Language, Information and Computation, WoLLIC 2008, held in Edinbur...

Πίνακας περιεχομένων:

• Tutorials and Invited Lectures
• Inter-deriving Semantic Artifacts for Object-Oriented Programming
• On the Descriptive Complexity of Linear Algebra
• Talks on Quantum Computing
• On Game Semantics of the Affine and Intuitionistic Logics
• The Grammar of Scope
• Contributed Papers
• Conjunctive Grammars and Alternating Pushdown Automata
• Expressive Power and Decidability for Memory Logics
• Reasoning with Uncertainty by Nmatrix–Metric Semantics
• A Propositional Dynamic Logic for CCS Programs
• Towards Ontology Evolution in Physics
• Nominal Matching and Alpha-Equivalence
• Interval Additive Generators of Interval T-Norms
• Propositional Dynamic Logic as a Logic of Belief Revision
• Time Complexity and Convergence Analysis of Domain Theoretic Picard Method
• On the Formal Semantics of IF-Like Logics
• One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations
• Labelled Calculi for ?ukasiewicz Logics
• An Infinitely-Often One-Way Function Based on an Average-Case Assumption
• On Characteristic Constants of Theories Defined by Kolmogorov Complexity
• Adversary Lower Bounds for Nonadaptive Quantum Algorithms
• On Second-Order Monadic Groupoidal Quantifiers
• Inference Processes for Quantified Predicate Knowledge
• Using ? -ctl to Specify Complex Planning Goals
• Hyperintensional Questions
• Skolem Theory and Generalized Quantifiers
• On a Graph Calculus for Algebras of Relations.