Logic, language, information and computation : 15th International Workshop, WoLLIC 2008, Edinburgh, UK, July 1-4, 2008 : proceedings

• Main Authors: Workshop on Logic, Language, Information and Computation, Hodges, Wilfrid, Queiroz, Ruy J. G. B. de
• Format: eBook Book
• Language: English
• Published: Berlin ; New York Springer 2008; Springer Berlin / Heidelberg
• Edition: 1
• Series: Lecture Notes in Computer Science
• Subjects: Congresses; Logic, Symbolic and mathematical; Logic, Symbolic and mathematical > Congresses

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

Table of Contents:

• Title Page -- Preface -- Organization -- Table of Contents -- Inter-deriving Semantic Artifacts for Object-Oriented Programming (Extended Abstract) -- Introduction -- Background and First Contribution -- Further Background and Contributions -- Overview -- Abadi and Cardelli's Untyped Calculus of Objects: The \varsigma-Calculus -- A Reduction Semantics -- The Corresponding Abstract Machine -- The Corresponding Natural Semantics -- Summary and Conclusion -- Object Methods as Closures: the \varsigma\rho-Calculus -- A Natural Semantics -- The Corresponding Abstract Machine -- The Corresponding Reduction Semantics -- Summary and Conclusion -- Coherence between the -Calculus and the \varsigma\rho-Calculus -- From Closures to Terms -- A Bisimulation between the Two Abstract Machines -- Related Work -- Conclusion and Issues -- On the Descriptive Complexity of Linear Algebra -- Introduction -- Fixed-Point and Counting Logics -- Problems from Linear Algebra -- Further Directions -- Conclusion -- Talks on Quantum Computing -- Tutorial 1: A Rosetta Stone for Quantum Computing -- Tutorial 2: Quantum Algorithms: Past, Present, and Future -- Invited Talk: Quantum Knots and Mosaics -- On Game Semantics of the Affine and Intuitionistic Logics (Extended Abstract) -- Logic of Tasks and Intuitionistic Logic -- The Semantics -- Accomplishable Formulas and Affine Logic -- Accomplishable Formulas and the Intuitionistic Propositional Calculus IPC -- Japaridze's Game Semantics and Accomplishability -- Static Games -- Operations on Games -- Winnable = Accomplishable -- Countable Branching Recurrence -- Historical and Terminological Remarks -- Uncountable Branching Recurrence -- Summary of Results -- The Grammar of Scope -- Conjunctive Grammars and Alternating Pushdown Automata (Extended Abstract) -- Introduction -- Conjunctive Grammars
• Proofs of Theorems 4, 5 and 7 -- Bounded {\euro}ukasiewicz Logic -- An Infinitely-Often One-Way Function Based on an Average-Case Assumption -- Introduction -- Preliminaries -- Average-Case Complexity -- Infinitely-Often One-Way Functions -- Main Result -- Proof Strategy -- Proof Details -- On Characteristic Constants of Theories Defined by Kolmogorov Complexity -- Introduction -- Arithmetizing Computability -- Characteristic Constants -- Adversary Lower Bounds for Nonadaptive Quantum Algorithms -- Introduction -- Definition of the Model -- A Direct Method -- Lower Bound Theorem and Applications -- Proof of Theorem 3 -- From the Dual to the Primal -- Application to Ordered Search and Connectivity -- Some Open Problems -- On Second-Order Monadic Groupoidal Quantifiers -- Introduction -- Generalized Quantifiers -- Groupoidal Quantifiers {Q_L} -- Groupoidal Quantifiers Q^{\star}_L -- Connection to Leaf Automata -- Conclusion -- Inference Processes for Quantified Predicate Knowledge -- Motivation -- The Method -- The Existence of the Limit -- Some Generalizations -- Using {\alpha}-CTL to Specify Complex Planning Goals -- Introduction -- Planning Based on Model Checking -- Domains, Problems and Solutions -- The Branching Time Temporal Logic CTL -- Goal Specification Using CTL -- The New Branching Time Temporal Logic {\alpha}-CTL -- The Syntax of -ctl -- The Models in -ctl -- The Semantics of -ctl -- Goal Specification in {\alpha}-CTL -- An Agent Who Tries Its Best -- Specifying ``Try Its Best to Achieve g'' in {\alpha}-CTL -- Comparing Specifications in {\alpha}-CTL and p-CTL -- Conclusion -- Hyperintensional Questions -- Introduction -- Higher Order Logic (HOL) with Subtypes -- The Theory of Meanings -- Worlds and Extensions at Them -- Questions in a Hyperintensional Setting -- What Have We Gained? What Have We Lost?
• Linear Conjunctive Grammars -- Synchronized Alternating Pushdown Automata -- Main Results -- Mildly Context-Sensitive Languages -- Related Work -- Alternating Grammars -- Conjunction in Lambek Categorial Grammars -- Concluding Remarks -- Expressive Power and Decidability for Memory Logics -- Memory Logics: Hybrid Logics with a Twist -- Bisimulation -- Expressivity -- Infinite Models and Undecidability -- Conclusions and Further Work -- Reasoning with Uncertainty by Nmatrix-Metric Semantics -- Introduction -- Distance-Based Non-deterministic Semantics -- Non-deterministic Matrices -- Preferential Distance-Based Entailments -- Examples of Reasoning with \models_\Ss -- General Properties of \models_\Ss -- Some Particular Cases of Reasoning with \models_\Ss -- Supplementary Material -- A Propositional Dynamic Logic for CCS Programs -- Introduction -- Background -- Propositional Dynamic Logic -- Calculus for Communicating Systems -- PDL for CCS Programs without Constants -- Language and Semantics -- Proof Theory -- PDL for CCS Programs -- Language and Semantics -- Proof Theory -- Final Remarks and Future Work -- Completeness Proof -- Towards Ontology Evolution in Physics -- Introduction -- Related Work -- Ontology Repair Plans -- Implementation -- Applications to the Development Case Studies -- The Application of wms to the Discovery of Latent Heat -- The Application of wms to Dark Matter -- The Application of Inconstancy to Modified Newtonian Mechanics -- Conclusion -- The ``Where's My Stuff?" Ontology Repair Plan -- The Inconstancy Ontology Repair Plan -- Example Code -- Nominal Matching and Alpha-Equivalence -- Introduction -- Background -- The Algorithm -- Core Algorithm -- Checking the Validity of {\alpha}-Equivalence Constraints -- Solving Matching Problems -- Implementation -- Complexity -- Benchmarks -- Conclusions
• Interval Additive Generators of Interval T-Norms -- Introduction -- Interval Representations -- Additive Generators and T-Norms -- Interval T-Norms -- Interval Additive Generators of Interval T-Norms -- Conclusion and Final Remarks -- Propositional Dynamic Logic as a Logic of Belief Revision -- Introduction -- PDL as a Belief Revision Logic -- Action Model Update -- Adding Factual Change and Belief Change -- Expressivity of Action Update with Changes -- Future Work -- Time Complexity and Convergence Analysis of Domain Theoretic Picard Method -- Context -- Implementation of Picard Iteration -- Approximating Reals and Functions -- Overview of the Solver -- Convergence Analysis -- Convergence Analysis: No Round-O Errors -- Convergence Analysis: Round-O Errors -- Optimising the IVP Solver -- Prediction of Computation Time -- Conclusion -- References -- On the Formal Semantics of IF-Like Logics -- Introduction -- Preliminaries -- Syntax -- Semantics -- Signaling Kicks in -- Uniform Semantics for Regular and Irregular Formulas -- Game Theoretical Semantics for IF with Flattening -- Conclusions -- Technical Appendix -- Compositionality for T-Semantics -- Proof of Proposition 1 -- Proof of Theorem 1 -- Proof of Theorem 3 -- Proof of Theorem 4 -- One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations -- Introduction -- Terms, Types, and Natural Deduction -- Terms and Types -- Examples -- Natural Deduction -- Admissible Rules -- Derivation-Search (Sketch) -- Conclusions -- Technical Appendix -- Labelled Calculi for {\euro}ukasiewicz Logics -- Introduction -- {\euro}ukasiewicz Logics -- Labelled Proof Rules for {{\euro}_n} -- New Decision Procedures for {{\euro}_n} -- The {\mathbb{Z}}{\euro} Calculus -- A Terminating Calculus for {\euro} -- Conclusion and Perspectives -- Proofs of Propositions 3 and 4
• Skolem Theory and Generalized Quantifiers -- Introduction -- Are Independent Set Readings Really Available in NL? -- The Need of Maximality Conditions -- Extending Sher's Theory to All NL Determiners -- A Uniform Logical Framework for Referential NPs -- Conclusions -- On a Graph Calculus for Algebras of Relations -- Introduction -- Relational Framework -- Non-negative Graph Relational Framework -- Non-negative Graph Relational Calculus -- Full-Relational Graph Calculus -- Proof Theory for Linear Lattices -- Conclusion -- References -- Author Index