000 04439nam a22005895i 4500
001 978-3-540-69937-8
003 DE-He213
005 20170515111650.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540699378
_9978-3-540-69937-8
024 7 _a10.1007/978-3-540-69937-8
_2doi
050 4 _aBC1-199
072 7 _aHPL
_2bicssc
072 7 _aPHI011000
_2bisacsh
082 0 4 _a160
_223
245 1 0 _aLogic, Language, Information and Computation
_h[electronic resource] :
_b15th International Workshop, WoLLIC 2008 Edinburgh, UK, July 1-4, 2008 Proceedings /
_cedited by Wilfrid Hodges, Ruy de Queiroz.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _aVIII, 313 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5110
505 0 _aTutorials 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.
520 _aEdited 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 Edinburgh, UK, in July 2008. The 21 revised full papers presented together with the abstracts of 7 tutorials and invited lectures were carefully reviewed and selected from numerous submissions. The papers cover all pertinent subjects in computer science 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.
650 0 _aPhilosophy.
650 0 _aLogic.
650 0 _aComputer programming.
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aMathematical logic.
650 0 _aArtificial intelligence.
650 1 4 _aPhilosophy.
650 2 4 _aLogic.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aProgramming Techniques.
650 2 4 _aTheory of Computation.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aHodges, Wilfrid.
_eeditor.
700 1 _aQueiroz, Ruy de.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540699361
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5110
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-69937-8
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _2ddc
_cEB
950 _aComputer Science (Springer-11645)
999 _c18017
_d18017