Logic, Language, Information and Computation
Springer Berlin (Verlag)
978-3-540-69936-1 (ISBN)
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 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.
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.
| Erscheint lt. Verlag | 19.6.2008 |
|---|---|
| Reihe/Serie | Lecture Notes in Artificial Intelligence | Lecture Notes in Computer Science |
| Zusatzinfo | VIII, 313 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Geisteswissenschaften ► Philosophie ► Allgemeines / Lexika |
| Geisteswissenschaften ► Philosophie ► Logik | |
| Mathematik / Informatik ► Informatik | |
| Schlagworte | action • adaptive functions • Algorithm analysis and problem complexity • algorithms • Artificial Intelligence • Automata • Belief Revision • Calculi • classical computability • Complementation • Completeness • Complexity theory • Computational Logic • Computational modeling • decision procedure • epistemic dynamic logic • Formal Languages • Fuzzy Logic • Grammars • graph calculus • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Hybrid Logic • inference processes • knowledge update • Logic • Lower Bounds • methodology of computing • Modal Logic • Model Checking • NATURAL • Operational Semantics • Probability Logic • Program Transformation • Proof theory • Quantum Algorithms • query complexity • randomness • recursion theory • relational language • Simulation • Static Analysis • symmetry • Type Theory • uncertain reasoning • verification |
| ISBN-10 | 3-540-69936-8 / 3540699368 |
| ISBN-13 | 978-3-540-69936-1 / 9783540699361 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
