Logic, Language, Information, and Computation 20th International Workshop, WoLLIC 2013, Darmstadt, Germany, August 20-23, 2013, Proceedings

• Main Authors: Libkin, Leonid, Kohlenbach, Ulrich, de Queiroz, Ruy
• Format: eBook
• Language: English
• Published: Netherlands Springer Nature 2013; Springer Berlin / Heidelberg; Springer
• Edition: 1
• Series: Lecture Notes in Computer Science
• Subjects: Künstliche Intelligenz.-gnd-(DE-588)4033447-8; Language and logic; Logic, Symbolic and mathematical; Mathematics. General principles
• ISBN: 9783642399923; 3642399924; 3642399916; 9783642399916

Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the 20th Workshop on Logic, Language, Information and Communication, WoLLIC 2013, held in Darmstadt, Germany, in August 2013. The 17 contributed papers presented t...

Table of Contents:

• 4 Separability in the Context of Belief Change Operations -- 4.1 The Basic Belief Change Postulates -- 4.2 Belief Change Operations and Language Splitting -- 4.3 Separation-Based Belief Change Operations -- 5 Discussion and Conclusion -- References -- Independence in Database Relations -- 1 Introduction -- 2 Related Work -- 3 Independence Atoms -- 3.1 Syntax and Semantics -- 3.2 The Implication Problem -- 4 Axiomatic Characterization -- 5 Algorithmic Characterization -- 6 Armstrong Relations -- 7 Conclusion and Future Work -- References -- Substructural Logic of Proofs -- 1 Introduction -- 2 Bimodal Substructural Logic -- 3 Substructural Logic of Proofs -- 4 Prehistoric-Loop-Free Proofs -- 5 Non-self-Referential Constant Specifications -- 6 Discussions -- References -- Full Lambek Hyperdoctrine: Categorical Semantics for First-Order Substructural Logics -- 1 Introduction -- 2 Typed Full Lambek Calculus -- 3 Full Lambek Hyperdoctrine -- 4 Duality-Induced Set-Theoretical Hyperdoctrines -- 5 Girard's and G¨odel's Translation Hyperdoctrinally -- References -- A Finite Model Property for G¨odel Modal Logics -- 1 Introduction -- 2 G¨odel Modal Logics -- 3 A New Semantics and Finite Model Property -- 4 Proof of Theorem 1 -- 5 A Crisp G¨odel S5 Logic -- 6 Concluding Remarks -- References -- Model Checking for Modal Dependence Logic: An Approach through Post's Lattice -- 1 Introduction -- 2 The Modal Language and Its Fragments -- 3 Complexity Results -- 4 Conclusion -- References -- Ockhamist Propositional Dynamic Logic: A Natural Link between PDL and CTL -- 1 Introduction -- 2 Ockhamist Propositional Dynamic Logic -- 2.1 Syntax -- 2.2 Semantics -- 3 Relationships between OPDL, PDL and CTL -- 3.1 Relationships between OPDL and PDL -- 3.2 Relationships between OPDL and PDL -- 3.3 Relationships with Other Logics: Discussion
• 4 A Variant of OPDL Interpreted over Labeled Transition Systems -- 5 Perspectives -- References -- Information, Awareness and Substructural Logics -- 1 Introduction -- 2 Logical Omniscience and Awareness -- 3 Awareness and Information -- 3.1 Awareness Generalised -- 3.2 Information Models -- 4 Information and Substructural Logics -- 5 Substructural Epistemic Logics -- 5.1 Substructural Information Models -- 5.2 Factive and Introspective Models -- 5.3 Common Belief -- 6 Public Information Introduction -- 7 Conclusion -- References -- Author Index
• Intro -- Preface -- Organization -- Table of Contents -- Logic and Agent Programming Languages -- 1 Introduction -- 2 Agent Programming Languages -- 3 Briefly: BDI Logics -- 4 Belief Update -- 4.1 Standard Belief Update -- 4.2 Standard Belief Update in the Presence of Query Caching -- 5 Maintaining the Plan Base -- References -- Natural Models of Homotopy Type Theory -- References -- Modelling Infinite Structures with Atoms -- 1 Introduction -- 2 Sets with Atoms -- 3 First-Order Logic and Flat Models -- 3.1 Flat Models and Stand First-Order Logic -- 3.2 Compactness Fails in Legal Flat Models -- 4 First-Order Logic with Orbit-Finite Boolean Operations -- 5 A Proof System -- 6 Stratified Models -- 6.1 Ultimately Directed Sets -- 6.2 Stratified Models -- References -- Counting in SPARQL Property Paths: Perspectives from Theory and Practice -- References -- Quantitative Approaches to Information Protection -- References -- Perspectives of Dynamic Complexity -- References -- Linear Time Proof Verification on N-Graphs: A Graph Theoretic Approach -- 1 Introduction -- 2 N-Graphs -- 2.1 Proof-Graphs -- 2.2 Inadequacy -- 2.3 Soundness Criteria -- 3 Verification of Proof-Graphs -- 3.1 Cycle Analysis -- 3.2 Connectivity Analysis -- 3.3 The Algorithm -- 4 Danos-Regnier and Extension to MLL -- References -- First Order Extensions of Residue Classes and Uniform Circuit Complexity -- 1 Introduction -- 2 Preliminaries -- 3 The Logic of Finite Residue Class Rings and Uniform Circuit Complexity Classes -- 4 The Prime Spectrum of a Sentence -- 5 The Density of the Prime Spectrum of a Sentence -- 6 On the Existence of Spectra without Density -- 7 Final Comments -- References -- Quantum Probabilistic Dyadic Second-Order Logic -- 1 Introduction -- 2 Preliminaries -- 3 Quantum Probabilistic Dyadic Second-Order Logic -- 4 Examples -- 4.1 Quantum Teleportation
• 4.2 Quantum Search Algorithm -- 4.3 Deutsch-Josza Algorithm -- 5 Decidability -- 6 Conclusions -- References -- Structural Extensions of Display Calculi: A General Recipe -- 1 Introduction -- 2 Display Calculi in a Nutshell -- 3 The Recipe -- 4 Case Studies -- 4.1 Bi-intuitionistic Logic -- 4.2 Intuitionistic Logic -- 4.3 Bunched Logics -- 4.4 Modal and Tense Logics -- References -- The Same, Similar, or Just Completely Different? Equivalence for Argumentation in Light of Logic -- 1 Introduction -- 2 Background -- 3 Notions of Equivalence for Argumentation -- 4 Characterizing Behavioral Equivalence -- 5 Conclusion -- References -- Boolean Dependence Logic and Partially-Ordered Connectives -- 1 Introduction -- 2 Preliminaries -- 2.1 Boolean Dependence Logic -- 2.2 Partially-Ordered Connectives -- 2.3 Fragments of BD -- 3 Equivalences -- 4 Separations -- 5 Conclusion -- References -- Extended Modal Dependence Logic EMDL -- 1 Introduction -- 2 Preliminaries -- 3 Expressivity of EMDL -- 4 Complexity of EMDL -- 5 Conclusion -- References -- Dependence Logic with Generalized Quantifiers: Axiomatizations -- 1 Introduction -- 2 Preliminaries -- 2.1 Dependence Logic -- 2.2 D(Q) -- 3 Natural Deduction for D(Q, ˇQ) -- 3.1 Soundness of the Rules -- 4 Completeness Results for FO(Q, ˇQ) Consequences -- 4.1 Deriving a Normal Form for D(Q, ˇQ) -- 4.2 Completeness for D(Q, ˇQ) -- 4.3 Completeness for D(Q1,Qˇ1) -- 5 Conclusion -- References -- Continuous Truth II: Reflections -- 1 Introduction -- 2 Preliminaries -- 2.1 Frames and Locales -- 3 Reflections -- 3.1 Topological Models -- 3.2 Extensions over Sites -- 3.3 Continuous Truth -- References -- A Simple Separation Logic -- 1 Introduction -- 2 Set Separation Logic -- 3 Complexity -- 3.1 DL-PA: Dynamic Logic of Propositional Assignments -- 3.2 Embedding Set Separation Logic into DL-PA