English
Related papers

Related papers: Intensional FOL: Many-Sorted Extension

200 papers

Generic ontologies were introduced as an extension (Generic DOL) of the Distributed Ontology, Modeling and Specification Language, DOL, with the aim to provide a language for Generic Ontology Design Patterns. In this paper we present a…

Logic in Computer Science · Computer Science 2019-06-17 Mihai Codescu , Bernd Krieg-Brückner , Till Mossakowski

We define a modular multi-concept extension of the lexicographic closure semantics for defeasible description logics with typicality. The idea is that of distributing the defeasible properties of concepts into different modules, according…

Artificial Intelligence · Computer Science 2020-09-07 Laura Giordano , Daniele Theseider Dupré

This paper defines multiset-valued linear index grammar and unordered vector grammar with dominance links. The former models certain uses of multiset-valued feature structures in unification-based formalisms, while the latter is motivated…

cmp-lg · Computer Science 2008-02-03 Owen Rambow

Multisorted modules, equivalently representations of quivers, equivalently additive functors on preadditive categories, encompass a wide variety of additive structures. In addition, every module has a natural and useful multisorted…

Representation Theory · Mathematics 2018-08-01 Mike Prest

We continue our investigation into hybrid polyadic multi-sorted logic with a focus on expresivity related to the operational and axiomatic semantics of rogramming languages, and relations with first-order logic. We identify a fragment of…

Logic in Computer Science · Computer Science 2020-07-06 Ioana Leuştean , Natalia Moangă , Traian Florin Şerbănuţă

Contemporary use of the term 'intension' derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intensional FOL (First-order-logic) for P2P systems by fusing the…

Databases · Computer Science 2011-03-07 Zoran Majkic

First-Order Logic (FOL) is widely regarded as one of the most important foundations for knowledge representation. Nevertheless, in this paper, we argue that FOL has several critical issues for this purpose. Instead, we propose an…

Artificial Intelligence · Computer Science 2017-05-01 Yi Zhou

The availability of an abundance of knowledge sources has spurred a large amount of effort in the development and enhancement of Information Retrieval techniques. Users information needs are expressed in natural language and successful…

Information Retrieval · Computer Science 2020-04-24 Bhawani Selvaretnam , Mohammed Belkhatir

We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which…

Logic in Computer Science · Computer Science 2023-06-22 James Laird

Intensional computation derives concrete outputs from abstract function definitions; extensional computation defines functions through explicit input-output pairs. In formal semantics: intensional computation interprets expressions as…

Category Theory · Mathematics 2024-09-05 Daniel Quigley

Compositionality is a widely discussed property of natural languages, although its exact definition has been elusive. We focus on the proposal that compositionality can be assessed by measuring meaning-form correlation. We analyze…

Computation and Language · Computer Science 2020-12-08 Timothee Mickus , Timothée Bernard , Denis Paperno

This paper is a contribution to the theoretical foundations of strategies. We first present a general definition of abstract strategies which is extensional in the sense that a strategy is defined explicitly as a set of derivations of an…

Computer Science and Game Theory · Computer Science 2010-01-26 Tony Bourdier , Horatiu Cirstea , Daniel Dougherty , Hélène Kirchner

Due to its expressiveness and unambiguous nature, First-Order Logic (FOL) is a powerful formalism for representing concepts expressed in natural language (NL). This is useful, e.g., for specifying and verifying desired system properties.…

Artificial Intelligence · Computer Science 2025-11-18 Andrea Brunello , Luca Geatti , Michele Mignani , Angelo Montanari , Nicola Saccomanno

The idea of using unfolding as a way of computing a program semantics has been applied successfully to logic programs and has shown itself a powerful tool that provides concrete, implementable results, as its outcome is actually source…

Programming Languages · Computer Science 2017-08-29 José María Rey-Poza , Julio Mariño-Carballo

Recent advances in interpretable Machine Learning (iML) and eXplainable AI (XAI) construct explanations based on the importance of features in classification tasks. However, in a high-dimensional feature space this approach may become…

Machine Learning · Statistics 2018-06-21 Jasper van der Waa , Marcel Robeer , Jurriaan van Diggelen , Matthieu Brinkhuis , Mark Neerincx

We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…

Computation and Language · Computer Science 2011-02-28 Victor Gluzberg

The article investigates the properties of associative ideals in monoids. Such ideals have some applications in the logic of non-standard sequences and category theory. The relations of these ideals with the verbal structure of words over…

Group Theory · Mathematics 2024-03-22 Volodymyr Zhuravlov

The principle of compositionality, which enables natural language to represent complex concepts via a structured combination of simpler ones, allows us to convey an open-ended set of messages using a limited vocabulary. If compositionality…

Computation and Language · Computer Science 2020-02-18 Yi Ren , Shangmin Guo , Matthieu Labeau , Shay B. Cohen , Simon Kirby

Whether language models (LMs) have inductive biases that favor typologically frequent grammatical properties over rare, implausible ones has been investigated, typically using artificial languages (ALs) (White and Cotterell, 2021;…

Computation and Language · Computer Science 2025-10-15 Nadine El-Naggar , Tatsuki Kuribayashi , Ted Briscoe

We present an analysis of the semantic interpretation of intensional verbs such as seek that allows them to take direct objects of either individual or quantifier type, producing both de dicto and de re readings in the quantifier case, all…

cmp-lg · Computer Science 2008-02-03 Mary Dalrymple , John Lamping , Fernando Pereira , Vijay Saraswat