Cargando…

Logic, Language, Information and Computation 17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010, Proceedings /

This volume contains the papers presented at WoLLIC 2010: 17th Workshop on Logic, Language, Information and Computation held during July 6-9, 2010, on the campus of Universidade de Bras´ ?lia (UnB), Brazil. The Workshop on Logic, Language, Information and Computation (WoL- LIC) is an annual event, m...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Dawar, Anuj (Editor ), de Queiroz, Ruy (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edición:1st ed. 2010.
Colección:Lecture Notes in Artificial Intelligence, 6188
Temas:
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Entailment Multipliers: An Algebraic Characterization of Validity for Classical and Modal Logics
  • A CTL-Based Logic for Program Abstractions
  • Application of Logic to Integer Sequences: A Survey
  • The Two-Variable Fragment with Counting Revisited
  • Intuitionistic Logic and Computability Theory
  • Foundations of Satisfiability Modulo Theories
  • Logical Form as a Determinant of Cognitive Processes
  • Formal Lifetime Reliability Analysis Using Continuous Random Variables
  • Modal Logics with Counting
  • Verification of the Completeness of Unification Algorithms à la Robinson
  • Mechanisation of PDA and Grammar Equivalence for Context-Free Languages
  • On the Role of the Complementation Rule for Data Dependencies over Incomplete Relations
  • Decidability and Undecidability Results on the Modal ?-Calculus with a Natural Number-Valued Semantics
  • Solving the Implication Problem for XML Functional Dependencies with Properties
  • On Anaphora and the Binding Principles in Categorial Grammar
  • Feasible Functions over Co-inductive Data
  • Interval Valued Fuzzy Coimplication
  • Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signatures
  • Intersection Type Systems and Explicit Substitutions Calculi
  • Generalising Conservativity.