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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Dawar, Anuj (Επιμελητής έκδοσης), Queiroz, Ruy de (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Σειρά: Lecture Notes in Computer Science, 6188
• Θέματα: Computer science.; Computer programming.; Programming languages (Electronic computers).; Computers.; Algorithms.; Computer logic.; Mathematical logic.; Computer Science.; Programming Languages, Compilers, Interpreters.; Programming Techniques.; Theory of Computation.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Algorithm Analysis and Problem Complexity.

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

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

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