000 03913nam a22003855i 4500
001 302055
003 MX-SnUAN
005 20160429155733.0
007 cr nn 008mamaa
008 150903s2010 gw | o |||| 0|eng d
020 _a9783642138249
_99783642138249
024 7 _a10.1007/9783642138249
_2doi
035 _avtls000355249
039 9 _a201509030953
_bVLOAD
_c201405060347
_dVLOAD
_y201402191038
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA8.9-QA10.3
100 1 _aDawar, Anuj.
_eeditor.
_9338679
245 1 0 _aLogic, Language, Information and Computation :
_b17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010. Proceedings /
_cedited by Anuj Dawar, Ruy Queiroz.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _ax, 259 páginas 28 ilustraciones
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6188
500 _aSpringer eBooks
505 0 _aEntailment 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.
520 _aThis book is edited in collaboration with FoLLI, the Association of Logic, Language and Information. It constitutes the proceedings of the 17th International Workshop on Logic, Language, Information and Computation, WoLLIC 2010, held in Brasilia, Brazil, in July 2010. The book presents 7 invited talks together with 13 papers which were carefully reviewed and selected from 32 submissions. The papers cover some of the most active areas of research on the frontiers between computation, logic, and linguistics, with particular interest in cross-disciplinary topics. Typical areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aQueiroz, Ruy.
_eeditor.
_9333335
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783642138232
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-13824-9
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c302055
_d302055