样式: 排序: IF: - GO 导出 标记为已读
-
Monotonic Inference with Unscoped Episodic Logical Forms: From Principles to System J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-11-30 Gene Louis Kim, Mandar Juvekar, Junis Ekmekciu, Viet Duong, Lenhart Schubert
-
Capturing the Varieties of Natural Language Inference: A Systematic Survey of Existing Datasets and Two Novel Benchmarks J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-11-20 Reto Gubelmann, Ioannis Katis, Christina Niklaus, Siegfried Handschuh
-
Monotonicity Reasoning in the Age of Neural Foundation Models J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-11-15 Zeming Chen, Qiyue Gao
-
Formal Modelling and Verification of Probabilistic Resource Bounded Agents J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-11-15 Hoang Nga Nguyen, Abdur Rakib
-
-
A Computational Algebraic Analysis of Hindi Syntax J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-11-11 Alok Debanth, Manish Shrivastava
In this paper, we present a computational algebraic representation of Hindi syntax. This paper is the first attempt to establish the representation of various facets of Hindi syntax into algebra, including dual nominative/ergative behavior, a syntacto-semantic case system and complex agreement rules between the noun and verb phrase. Using the pregroup analysis framework, we show how we represent morphological
-
Assessing the Strengths and Weaknesses of Large Language Models J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-11-11 Shalom Lappin
-
Commutative Lambek Grammars J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-10-30 Tikhon Pshenitsyn
Lambek categorial grammars is a class of formal grammars based on the Lambek calculus. Pentus proved in 1993 that they generate exactly the class of context-free languages without the empty word. In this paper, we study categorial grammars based on the Lambek calculus with the permutation rule LP. Of particular interest is the product-free fragment of LP called the Lambek-van Benthem calculus LBC.
-
Graph Grammar Formalism with Multigranularity for Spatial Graphs J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-10-06 Yufeng Liu, Fan Yang, Jian Liu
-
A Logical Theory for Conditional Weak Ontic Necessity Based on Context Update J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-09-21 Fengkui Ju
-
Iterated AGM Revision Based on Probability Revision J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-08-20 Sven Ove Hansson
Close connections between probability theory and the theory of belief change emerge if the codomain of probability functions is extended from the real-valued interval [0, 1] to a hyperreal interval with the same limits. Full beliefs are identified as propositions with a probability at most infinitesimally smaller than 1. Full beliefs can then be given up, and changes in the set of full beliefs follow
-
Convexity and Monotonicity in Language Coordination: Simulating the Emergence of Semantic Universals in Populations of Cognitive Agents J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-08-17 Nina Gierasimczuk, Dariusz Kalociński, Franciszek Rakowski, Jakub Uszyński
-
On the Fundamental Role of ‘Means That’ in Semantic Theorizing J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-07-07 Teo Grünberg, David Grünberg, Oğuz Akçelik
Our aim is to illuminate the interconnected notions of meaning and truth. For this purpose, we investigate the relationship between meaning theories based on commonsensical ‘means that’ and interpretive truth theories. The latter are Tarski–Davidson-style truth theories serving as meaning theories. We consider analytically true semantic principles containing ‘means’ and ‘means that’ side to side with
-
Modified Numerals and Split Disjunction: The First-Order Case J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-06-12 Maria Aloni, Peter van Ormondt
-
From Counterfactual Conditionals to Temporal Conditionals J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-06-03 Yuichiro Hosokawa
-
-
Propositional Forms of Judgemental Interpretations J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-05-03 Tao Xue, Zhaohui Luo, Stergios Chatzikyriakidis
-
Some Remarks on Semantics and Expressiveness of the Sentential Calculus with Identity J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-03-30 Steffen Lewitzka
R. Suszko’s Sentential Calculus with Identity \( SCI \) results from classical propositional calculus \( CPC \) by adding a new connective \(\equiv \) and axioms for identity \(\varphi \equiv \psi \) (which we interpret here as ‘propositional identity’). We reformulate the original semantics of \( SCI \) using Boolean prealgebras which, introduced in different ways, are known in the literature as structures
-
Names and Quantifiers: Bringing Them Together in Classical Logic J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-03-10 Jacek Paśniczek
Putting individual constants and quantifiers into the same syntactic category within first-order language promises to have far-reaching consequences: a syntax of this kind can reveal the potential of any such language, allowing us to realize that a vast class of noun phrases, including non-denoting terms, can be accommodated in the new syntax as expressions suited to being subjects of sentences. In
-
On $${{{\mathcal {F}}}}$$ -Systems: A Graph-Theoretic Model for Paradoxes Involving a Falsity Predicate and Its Application to Argumentation Frameworks J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-02-16 Gustavo Bodanza
-
Complexity of the Universal Theory of Residuated Ordered Groupoids J. Log. Lang. Inf. (IF 0.8) Pub Date : 2023-01-13 Dmitry Shkatov, C. J. Van Alten
We study the computational complexity of the universal theory of residuated ordered groupoids, which are algebraic structures corresponding to Nonassociative Lambek Calculus. We prove that the universal theory is co\(\textsf {NP}\)-complete which, as we observe, is the lowest possible complexity for a universal theory of a non-trivial class of structures. The universal theories of the classes of unital
-
A Modal Loosely Guarded Fragment of Second-Order Propositional Modal Logic J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-12-21 Gennady Shtakser
In this paper, we introduce a variant of second-order propositional modal logic interpreted on general (or Henkin) frames, \(SOPML^{\mathcal {H}}\), and present a decidable fragment of this logic, \(SOPML^{\mathcal {H}}_{dec}\), that preserves important expressive capabilities of \(SOPML^{\mathcal {H}}\). \(SOPML^{\mathcal {H}}_{dec}\) is defined as a modal loosely guarded fragment of \(SOPML^{\mathcal
-
Language Learnability in the Limit: A Generalization of Gold’s Theorem J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-12-21 Fernando C. Alves
In his pioneering work in the field of inductive inference, Gold (Inf Control 10:447–474, 1967) proved that a set containing all finite languages and at least one infinite language over the same fixed alphabet is not identifiable in the limit (learnable in the exact sense) from complete texts. Gold’s work paved the way for computational learning theories of language and has implications for two linguistically
-
Embedding HTLCG into $$\hbox {LCG}_\phi $$ J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-12-01 Jordan Needle
-
Feferman–Vaught Decompositions for Prefix Classes of First Order Logic J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-11-12 Abhisekh Sankaran
The Feferman–Vaught theorem provides a way of evaluating a first order sentence \(\varphi \) on a disjoint union of structures by producing a decomposition of \(\varphi \) into sentences which can be evaluated on the individual structures and the results of these evaluations combined using a propositional formula. This decomposition can in general be non-elementarily larger than \(\varphi \). We introduce
-
The Epistemology of Nondeterminism J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-11-08 Adam Bjorndahl
This paper proposes new semantics for propositional dynamic logic (PDL), replacing the standard relational semantics. Under these new semantics, program execution is represented as fundamentally deterministic (i.e., functional), while nondeterminism emerges as an epistemic relationship between the agent and the system: intuitively, the nondeterministic outcomes of a given process are precisely those
-
Deontic Paradoxes in Mīmāṃsā Logics: There and Back Again J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-10-19 Kees van Berkel, Agata Ciabattoni, Elisa Freschi, Francesca Gulisano, Maya Olszewski
-
Type Polymorphism, Natural Language Semantics, and TIL J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-10-07 Ivo Pezlar
-
Some Notes on Dyadic Contingency J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-10-05 Jie Fan
In a recent work, Pizzi proposes a notion of dyadic non-contingency, and then gives an axiomatic system of dyadic non-contingency named \(\text {KD}\Delta ^2\), which is shown to be translationally equivalent to the deontic system KD and has the minimal system \(\text {K}\Delta \) of monadic contingency as a fragment. However, the reason why he defines dyadic non-contingency like that is unclear. In
-
Falsification-Aware Calculi and Semantics for Normal Modal Logics Including S4 and S5 J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-10-04 Norihiro Kamide
Falsification-aware (hyper)sequent calculi and Kripke semantics for normal modal logics including S4 and S5 are introduced and investigated in this study. These calculi and semantics are constructed based on the idea of a falsification-aware framework for Nelson’s constructive three-valued logic. The cut-elimination and completeness theorems for the proposed calculi and semantics are proved.
-
Referentiality and Configurationality in the Idiom and the Phrasal Verb J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-09-27 Cem Bozşahin
-
Non-transitive Correspondence Analysis J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-09-19 Yaroslav Petrukhin, Vasily Shangin
-
A Substructural Approach to Explicit Modal Logic J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-09-08 Shawn Standefer
In this paper, we build on earlier work by Standefer (Logic J IGPL 27(4):543–569, 2019) in investigating extensions of substructural logics, particularly relevant logics, with the machinery of justification logics. We strengthen a negative result from the earlier work showing a limitation with the canonical model method of proving completeness. We then show how to enrich the language with an additional
-
Algebraic Effects for Extensible Dynamic Semantics J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-08-26 Julian Grove, Jean-Philippe Bernardy
-
On the (Complete) Reasons Behind Decisions J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-08-18 Adnan Darwiche, Auguste Hirth
-
An Epistemic Separation Logic with Action Models J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-08-10 Hans van Ditmarsch, Didier Galmiche, Marta Gawek
-
Revising System Specifications in Temporal Logic J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-08-06 Paulo T. Guerra, Renata Wassermann
-
Computable Heyting Algebras with Distinguished Atoms and Coatoms J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-07-27 Nikolay Bazhenov
-
Kripke Contexts, Double Boolean Algebras with Operators and Corresponding Modal Systems J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-07-27 Prosenjit Howlader, Mohua Banerjee
-
Type-2 Fuzzy Sets and Newton’s Fuzzy Potential in an Algorithm of Classification Objects of a Conceptual Space J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-07-26 Adrianna Jagiełło, Piotr Lisowski, Roman Urban
-
An Incremental Grammar Approach to Multiple Nominative Constructions in Japanese J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-07-22 Tohru Seraku
-
Filtered Belief Revision: Syntax and Semantics J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-07-20 Giacomo Bonanno
In an earlier paper [Rational choice and AGM belief revision, Artificial Intelligence, 2009] a correspondence was established between the set-theoretic structures of revealed-preference theory (developed in economics) and the syntactic belief revision functions of the AGM theory (developed in philosophy and computer science). In this paper we extend the re-interpretation of those structures in terms
-
Belief Revision and Computational Argumentation: A Critical Comparison J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-05-31 Pietro Baroni, Eduardo Fermé, Massimiliano Giacomin, Guillermo Ricardo Simari
This paper aims at comparing and relating belief revision and argumentation as approaches to model reasoning processes. Referring to some prominent literature references in both fields, we will discuss their (implicit or explicit) assumptions on the modeled processes and hence commonalities and differences in the forms of reasoning they are suitable to deal with. The intended contribution is on one
-
The Effort of Reasoning: Modelling the Inference Steps of Boundedly Rational Agents J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-05-07 Anthia Solaki
-
Model Theoretical Aspects of Weakly Aggregative Modal Logic J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-05-04 Jixin Liu, Yifeng Ding, Yanjing Wang
Weakly Aggregative Modal Logic (\(\textsf {WAML}\)) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. \(\textsf {WAML}\) has interesting applications on epistemic logic, deontic logic, and the logic of belief. In this paper, we study some basic model theoretical aspects of \(\textsf {WAML}\). Specifically, we first give a van Benthem–Rosen characterization
-
IDL-PMCFG, a Grammar Formalism for Describing Free Word Order Languages J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-04-29 François Hublet
-
Logic and Interaction: Foreword to the Special Issue J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-04-30 Patrick Blackburn,Emiliano Lorini
-
Possibility and Dyadic Contingency J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-04-28 Claudio E. A. Pizzi
The paper aims at developing the idea that the standard operator of noncontingency, usually symbolized by Δ, is a special case of a more general operator of dyadic noncontingency Δ(−, −). Such a notion may be modally defined in different ways. The one examined in the paper is Δ(B, A) = df ◊B ∧ (A ⥽ B ∨ A ⥽ ¬B), where ⥽ stands for strict implication. The operator of dyadic contingency ∇(B, A) is defined
-
Non-strict Interventionism: The Case Of Right-Nested Counterfactuals J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-04-26 Katrin Schulz, Sonja Smets, Fernando R. Velázquez-Quesada, Kaibo Xie
-
A Logic for Conditional Local Strategic Reasoning J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-04-25 Valentin Goranko, Fengkui Ju
-
Composition Under Distributive Natural Transformations: Or, When Predicate Abstraction is Impossible J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-04-21 Dylan Bumford
-
A Matricial Vue of Classical Syllogistic and an Extension of the Rules of Valid Syllogism to Rules of Conclusive Syllogisms with Indefinite Terms J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-04-21 Dan Constantin Radulescu
One lists the distinct pairs of categorical premises (PCPs) formulable via only the positive terms, S,P,M, by constructing a six by six matrix obtained by pairing the six categorical P-premises, A(P,M), O(P,M), A(M,P*), O(M,P*), where P* ∈ {P,P′}, with the six, similar, categorical S-premises. One shows how five rules of valid syllogism (RofVS), select only 15 distinct PCPs that entail logical consequences
-
The Ramsey Test and Evidential Support Theory J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-04-10 Michal Sikorski
The Ramsey Test is considered to be the default test for the acceptability of indicative conditionals. I will argue that it is incompatible with some of the recent developments in conceptualizing conditionals, namely the growing empirical evidence for the Relevance Hypothesis. According to the hypothesis, one of the necessary conditions of acceptability for an indicative conditional is its antecedent
-
An Update of Tarski: Two Usages of the Word “True” J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-04-06 Zhen Zhao
-
A Modal Logic for Supervised Learning J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-03-28 Alexandru Baltag, Dazhu Li, Mina Young Pedersen
Formal learning theory formalizes the process of inferring a general result from examples, as in the case of inferring grammars from sentences when learning a language. In this work, we develop a general framework—the supervised learning game—to investigate the interaction between Teacher and Learner. In particular, our proposal highlights several interesting features of the agents: on the one hand
-
Logics with Group Announcements and Distributed Knowledge: Completeness and Expressive Power J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-03-24 Thomas Ågotnes, Natasha Alechina, Rustam Galimullin
Public announcement logic (PAL) is an extension of epistemic logic with dynamic operators that model the effects of all agents simultaneously and publicly acquiring the same piece of information. One of the extensions of PAL, group announcement logic (GAL), allows quantification over (possibly joint) announcements made by agents. In GAL, it is possible to reason about what groups can achieve by making
-
Who Should Be My Friends? Social Balance from the Perspective of Game Theory J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-03-23 Wiebe van der Hoek, Louwe B. Kuijer, Yì N. Wáng
We define balance games, which describe the formation of friendships and enmity in social networks. We show that if the agents give high priority to future profits over short term gains, all Pareto optimal strategies will eventually result in a balanced network. If, on the other hand, agents prioritize short term gains over the long term, every Nash equilibrium eventually results in a network that
-
Public Announcements, Public Lies and Recoveries J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-03-17 Kai Li, Jan van Eijck
The paper gives a formal analysis of public lies, explains how public lying is related to public announcement, and describes the process of recoveries from false beliefs engendered by public lying. The framework treats two kinds of public lies: simple lying update and two-step lying, which consists of suggesting that the lie may be true followed by announcing the lie. It turns out that agents’ convictions
-
A Simple and Non-Trivial Ramsey Test J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-03-14 Andreas Holger
This paper expounds a simple and non-trivial Ramsey Test. Drawing on the work of Peter Gärdenfors, it aims to help establish an epistemic alternative to the semantics of variably strict conditionals by Robert Stalnaker (in: Rescher (ed), Studies in logical theory, Blackwell, Oxford, 1968) and David Lewis (Counterfactuals, Blackwell, Oxford, 1973). The novelty of the present contribution lies in considering
-
A Reinterpretation of Beall’s ‘Off-Topic’ Semantics J. Log. Lang. Inf. (IF 0.8) Pub Date : 2022-02-24 Jeremiah Joven B. Joaquin
Jc Beall’s off-topic interpretation of Weak Kleene logic offers a logic of ‘true-and-topic’ preservation. However, Nissim Francez has recently argued that being ‘off-topic’ is a relational and not an absolute semantic property; as such, it fails to satisfy the conditions of truth-functionality. For Francez, this means that it ‘cannot serve as an interpretation of a truth-value’. In this paper, I propose