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

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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Hodges, Wilfrid (Editor ), de Queiroz, Ruy (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
Edición:1st ed. 2008.
Colección:Lecture Notes in Artificial Intelligence, 5110
Temas:
Logic.
Artificial intelligence.
Computer programming.
Computer science.
Algorithms.
Machine theory.
Artificial Intelligence.
Programming Techniques.
Theory of Computation.
Formal Languages and Automata Theory.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares