English
Related papers

Related papers: Intensional FOL: Many-Sorted Extension

200 papers

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

General Mathematics · Mathematics 2007-05-23 Alexander Sakharov

Unreplicated two-level factorial designs are often used in screening experiments to determine which factors out of a large plausible set are active. A theorem regarding the generalized word count pattern is stated and proved for…

Methodology · Statistics 2025-10-14 Xietao Zhou , Steven G. Gilmour

Incrementality is ubiquitous in human-human interaction and beneficial for human-computer interaction. It has been a topic of research in different parts of the NLP community, mostly with focus on the specific topic at hand even though…

Computation and Language · Computer Science 2018-06-15 Arne Köhn

The expression problem describes a fundamental tradeoff between two types of extensibility: extending a type with new operations, such as by pattern matching on an algebraic data type in functional programming, and extending a type with new…

Programming Languages · Computer Science 2025-11-21 Bohdan Liesnikov , David Binder , Tim Süberkrüb

Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…

Discrete Mathematics · Computer Science 2023-06-22 Murray Tannock , Michael Albert

We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…

Logic in Computer Science · Computer Science 2026-05-01 Fatemeh Ghasemi , Julien Grange

A generalized lexicographical order on infinite words is defined by choosing for each position a total order on the alphabet. This allows to define generalized Lyndon words. Every word in the free monoid can be factorized in a unique way as…

Discrete Mathematics · Computer Science 2018-12-12 Francesco Dolce , Antonio Restivo , Christophe Reutenauer

We explain the exact meaning of a statement we made in a previous paper on invariants, namely that a complex-valued function of the data of the functional equation of an $L$-function is an invariant if and only if it is stable under the…

Number Theory · Mathematics 2026-03-17 Jerzy Kaczorowski , Alberto Perelli

Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…

Artificial Intelligence · Computer Science 2020-12-22 Angelos Charalambidis , Giorgos Papadimitriou , Panos Rondogiannis , Antonis Troumpoukis

This paper focuses on unsupervised modeling of morphological families, collectively comprising a forest over the language vocabulary. This formulation enables us to capture edgewise properties reflecting single-step morphological…

Computation and Language · Computer Science 2017-02-24 Jiaming Luo , Karthik Narasimhan , Regina Barzilay

Motivated by applications to string processing, we introduce variants of the Lyndon factorization called inverse Lyndon factorizations. Their factors, named inverse Lyndon words, are in a class that strictly contains anti-Lyndon words, that…

Formal Languages and Automata Theory · Computer Science 2018-09-06 Paola Bonizzoni , Clelia De Felice , Rocco Zaccagnino , Rosalba Zizza

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

Selectional preference learning methods have usually focused on word-to-class relations, e.g., a verb selects as its subject a given nominal class. This papers extends previous statistical models to class-to-class preferences, and presents…

Computation and Language · Computer Science 2007-05-23 E. Agirre , D. Martinez

We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata)…

Formal Languages and Automata Theory · Computer Science 2011-02-17 Alexander Kurz , Tomoyuki Suzuki , Emilio Tuosto

Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…

Semantic parsing is the task of obtaining machine-interpretable representations from natural language text. We consider one such formal representation - First-Order Logic (FOL) and explore the capability of neural models in parsing English…

Computation and Language · Computer Science 2020-02-18 Hrituraj Singh , Milan Aggrawal , Balaji Krishnamurthy

Logics closed under classes of substitutions broader than class of uniform substitutions are known as hyperformal logics. This paper extends known results about hyperformal logics in two ways. First: we examine a very powerful form of…

Logic · Mathematics 2026-04-28 Shay Allen Logan , Blane Worley

Fonts are ubiquitous across documents and come in a variety of styles. They are either represented in a native vector format or rasterized to produce fixed resolution images. In the first case, the non-standard representation prevents…

Computer Vision and Pattern Recognition · Computer Science 2022-01-11 Pradyumna Reddy , Zhifei Zhang , Matthew Fisher , Hailin Jin , Zhaowen Wang , Niloy J. Mitra

Assortment planning, integral to multiple commercial offerings, is a key problem studied in e-commerce and retail settings. Numerous variants of the problem along with their integration into business solutions have been thoroughly…

Artificial Intelligence · Computer Science 2024-01-10 Saketh Reddy Karra , Theja Tulabandhula

We develop an extension of institution theory that accommodates implicitly the partiality of the signature morphisms and its syntactic and semantic effects. This is driven primarily by applications to conceptual blending, but other…

Logic · Mathematics 2017-09-01 Răzvan Diaconescu