Logic, Language, Information, and Computation: 29th International Workshop, WoLLIC 2023, Halifax, NS, Canada, July 11–14, 2023, Proceedings (Lecture Notes in Computer Science)

✍ Scribed by Helle Hvid Hansen (editor), Andre Scedrov (editor), Ruy J.G.B. de Queiroz (editor)

• Publisher: Springer
• Year: 2023
• Tongue: English
• Leaves: 420
• Category: Library

✦ Synopsis

Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the of the 29th International Workshop on Logic, Language, Information, and Computation, WoLLIC 2023, held in Halifax, NS, Canada, during July 11–14, 2023.

The 24 full papers (21 contributed, 3 invited) included in this book were carefully reviewed and selected from 46 submissions. The book also contains the abstracts for the 7 invited talks and 4 tutorials presented at WoLLIC 2023. The WoLLIC conference series aims at fostering interdisciplinary research in pure and applied logic.

✦ Table of Contents

Preface
Organization
Abstracts of Invited Talks
From Dynamic Epistemic Logic to Socially Intelligent Robots
Learning Context-Free Grammars from Positive Data and Membership Queries
Lambek Calculus and its Modal Extensions
A Short Introduction to SHACL for Logicians
Beliefs Based on Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence
From Incompleteness of Static Theories to Completeness of Dynamic Beliefs, in People and in Bots
The Epsilon Calculus in Non-classical Logics: Recent Results and Open Questions
Abstracts of Tutorials
Compositionality: Categorial Variations on a Theme
Description Logics and Other Decidable Logics for Graph-structured Data
Dempster-Shafer Theory and Topological Models for Evidence
Prerequisites for the Talk on Incompleteness of Static Theories and Completeness of Dynamic Beliefs, in People and in Bots
Contents
Invited Papers
Learning Context-Free Grammars from Positive Data and Membership Queries*-8pt
1 Introduction
2 Regular Languages
3 Context-Free Languages
3.1 Examples
3.2 Algorithm
References
A Short Introduction to SHACL for Logicians
1 What is SHACL and Why Do We Need It?
2 SHACL as a Logic
2.1 Syntax
2.2 Semantics
3 SHACL, OWL and Description Logics
3.1 Reasoning in SHACL and in OWL
4 What has Logic Done for SHACL?
4.1 Semantics of Recursive SHACL
4.2 Explaining Non-Validation
5 Conclusions and Outlook
References
From Gödel's Incompleteness Theorem to the Completeness of Bot Beliefs
1 Introduction
2 World as a Monoidal Category
2.1 State Spaces as Objects
2.2 Transitions as Morphisms
2.3 Monoidal Category of State Spaces and Transitions
3 String Diagrams
4 Universal Language
5 Self-explanations
6 Unfalsifiable Explanations
7 From Natural Science to Artificial Delusions
7.1 What Did We Learn?
7.2 Beyond True and False
References
Contributed Papers
Quantitative Global Memory
1 Introduction
2 Weak Open CBV
2.1 Syntax and Operational Semantics
2.2 A Quantitative Type System for the Weak Open CBV
3 A Lambda-Calculus with Global State
3.1 Syntax and Operational Semantics
3.2 A Quantitative Type System for the LambdaCC-Calculus
3.3 Soundness and Completeness
4 Conclusion and Related Work
References
Effective Skolemization
1 Introduction
2 Standard Skolemization and Andrews Skolemization
3 Atomic Skolemization
4 Speed-Up Result for Cut-Free Proofs
5 Cut-Free LK-Proofs With Positive Existential/Negative Universal Quantifiers and Resolution
6 Conclusion
References
Factive Complements are Not Always Unique Entities: A Case Study with Bangla remember
1 Setting the Stage
2 Existing Approaches Relating Factivity to Definiteness
3 Is Bangla remember Lexically Factive?
4 How to View Bangla remember
5 Accounting for the Factive Reading with an Indefinite Nominalized Complement
6 Summary and Future Work
References
Two-Layered Logics for Paraconsistent Probabilities
1 Introduction
2 Two Approaches to Paraconsistent Probabilities
3 Logics for Paraconsistent Probabilities
4 Hilbert-Style Axiomatisation of 4PrŁŁŁŁ
5 Decidability and Complexity
6 Conclusion
References
An Axiom System for Basic Hybrid Logic with Propositional Quantifiers
1 Introduction
2 Syntax and Substitution
3 Semantics
4 The Axiomatisation
5 Strong Completeness
6 Concluding Remarks
References
An Evidence Logic Perspective on Schotch-Jennings Forcing
1 Introduction
1.1 Evidence Models
1.2 Forcing and Level
2 Forcing and Modal Logic
3 Covers: Syntactic vs. Semantic
4 Semantics and Axiomatization for U
5 Definability and the Logic F
6 Soundness and Completeness of U
6.1 Soundness
6.2 Completeness
References
A Separation Logic with Histories of Epistemic Actions as Resources
1 Introduction
2 Semantics with Informative Actions as Resources
2.1 Knowledge and Informative Actions
2.2 Semantics for Separation and Composition of Action Histories
3 Gossip Protocols with AMHSL
4 Reduction from LKE to LKE Given a Bound max
4.1 Validities for Empty Histories and a Bound Max
4.2 Termination of Reduction from LKE to LKE
5 Remarks and Perspectives
References
Conditional Obligations in Justification Logic
1 Introduction
1.1 Chisholm's Set
1.2 Factual Detachment (FD) and Strong Factual Detachment (SFD)
2 Proof Systems for Alethic-Deontic Logic
2.1 Modal System
2.2 Preference Models
2.3 Justification Version of System E
3 Semantics
4 Preference Models
4.1 Soundness and Completeness w.r.t. Preference Models
5 Conclusion and Future Work
A Soundness and Completeness with Respect to Basic Models
References
Structural Completeness and Superintuitionistic Inquisitive Logics
1 Introduction
2 Intuitionistic Inquisitive Logic and Its Extensions
3 Structural Completeness
4 Schematic Closures of Inquisitive Gsi-Logics
5 Kripke Models
6 Conclusion
References
Validity in Choice Logics
1 Introduction
2 Preliminaries
2.1 Game-Theoretic Semantics
2.2 Game Choice Logics GCL
2.3 Degree-Based Semantics for GCL
3 A Provability Game
4 Proof Systems
5 Conclusion and Future Work
References
Aleatoric Propositions: Reasoning About Coins
1 Introduction
1.1 Related Work
1.2 Overview
2 Syntax and Semantics
2.1 Abbreviations
2.2 Motivation and Discussion
3 A Correspondence for Aleatoric Propositions
3.1 Aleatoric Functions
3.2 Positive Rational Functions
4 Conclusion and Future Work
References
Towards an Induction Principle for Nested Data Types
1 Introduction
1.1 Contributions
2 Dependently Typed Fold for Bush
3 Induction Principle for Bush
4 Higher-Order Folds and Dependently Typed Folds
4.1 Defining hfold from nfold
4.2 Defining nfold from hfold
5 Nested Data Types Beyond Bush
6 Discussion
7 Conclusion and Future Work
References
A Principled Approach to Expectation Maximisation and Latent Dirichlet Allocation Using Jeffrey's Update Rule
1 Introduction
2 Multisets and Distributions
2.1 Channels and Their Daggers
3 Jeffrey's Update Rule and Its Decrease of Divergence
4 Expectation Maximisation (EM)
5 Latent Dirichlet Allocation (LDA)
6 Conclusions
References
Parameterized Complexity of Propositional Inclusion and Independence Logic
1 Introduction
2 Preliminaries
3 Graph Representation of the Input
4 Complexity of Inclusion and Independence Logic
5 Concluding Remarks
References
Parallelism in Realizability Models
1 Introduction
2 Preliminary
3 Parallel Combinators in PCA
4 Predominances in the Category of Assemblies
5 Parallel Combinators with Respect to and -Subsets
6 Future Work
References
Bisimulations Between Verbrugge Models and Veltman Models
1 Introduction
2 Bisimulation Between Verbrugge and Veltman Model
3 Hennessy-Milner Theorem
4 Obtaining a Veltman Model Bisimilar to a Given Verbrugge Model
4.1 Sw-Paths
4.2 Well Defined Choice of Representatives
4.3 A Veltman Model Associated with a Given Verbrugge Model
4.4 The Main Result
5 Further Work
References
Focus-Style Proofs for the Two-Way Alternation-Free -Calculus
1 Introduction
2 The (Alternation-Free) Two-Way Modal -Calculus
3 The Proof System
3.1 Sequents
3.2 Proofs
4 The Proof Search Game
5 Soundness and Completeness
5.1 Soundness
5.2 Completeness
6 Conclusion
A Parity games
References
Relevant Reasoning and Implicit Beliefs
1 Introduction
2 Relevant Epistemic Logic with Classical Worlds
3 Axiomatization
4 Conclusion
References
Decidability of Modal Logics of Non-k-Colorable Graphs
1 Introduction
2 Preliminaries
3 Logics of Non-k-Colorable Graphs
4 Logics of Connected Graphs
5 Corollaries
6 Discussion
References
Subsumption-Linear Q-Resolution for QBF Theorem Proving
1 Introduction
2 Preliminaries
3 Prefix-Ordered QU-Resolution
4 Subsumption-Linear Q-Resolution
4.1 Derivation Power of SLQR
4.2 Derivation Power of SLQR–ures
4.3 Details for LIFO SLQR
5 Conclusion
References
Maximally Multi-focused Proofs for Skew Non-Commutative MILL
1 Introduction
2 The Sequent Calculus of SkNMILL
3 A Multi-focused Sequent Calculus
4 Maximal Multi-focusing Using Tags
5 Conclusions
References
Correction to: Decidability of Modal Logics of Non-k-Colorable Graphs
Correction to: Chapter 22 in: H. H. Hansen et al. (Eds.): Logic, Language, Information, and Computation, LNCS 13923, https://doi.org/10.1007/978-3-031-39784-4_22
Author Index