English
Related papers

Related papers: DATR Theories and DATR Models

200 papers

Children acquire their native language with apparent ease by observing how language is used in context and attempting to use it themselves. They do so without laborious annotations, negative examples, or even direct corrections. We take a…

Computation and Language · Computer Science 2021-03-18 Christopher Wang , Candace Ross , Yen-Ling Kuo , Boris Katz , Andrei Barbu

The aim of this paper is to show how we can handle the Recognising Textual Entailment (RTE) task by using Description Logics (DLs). To do this, we propose a representation of natural language semantics in DLs inspired by existing…

Computation and Language · Computer Science 2007-10-17 Paul Bedaride

Abstract Dialectical Frameworks (ADFs) are argumentation frameworks where each node is associated with an acceptance condition. This allows us to model different types of dependencies as supports and attacks. Previous studies provided a…

Artificial Intelligence · Computer Science 2019-07-24 João Alcântara , Samy Sá , Juan Acosta-Guadarrama

We study relationship between first order multiplicative linear logic (MLL1), which has been known to provide representations to different categorial grammars, and the recently introduced extended tensor type calculus (ETTC). We identify a…

Computation and Language · Computer Science 2022-01-03 Sergey Slavnov

An object--oriented approach to create a natural language understanding system is considered. The understanding program is a formal system built on the base of predicative calculus. Horn's clauses are used as well--formed formulas. An…

Computation and Language · Computer Science 2013-08-08 Yuriy Ostapov

Ontology is a popular method for knowledge representation in different domains, including the legal domain, and description logics (DL) is commonly used as its description language. To handle reasoning based on inconsistent DL-based legal…

Artificial Intelligence · Computer Science 2022-09-20 Zhe Yu , Yiwei Lu

Meaning Representation (AMR) is a semantic representation for natural language that embeds annotations related to traditional tasks such as named entity recognition, semantic role labeling, word sense disambiguation and co-reference…

Computation and Language · Computer Science 2017-04-11 Marco Damonte , Shay B. Cohen , Giorgio Satta

A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed $\lambda$-terms, defined using denotational…

Logic in Computer Science · Computer Science 2024-02-09 Vincent Moreau , Lê Thành Dũng Nguyên

This paper provides a geometric characterization of subclasses of the regular languages. We use finite model theory to characterize objects like strings and trees as relational structures. Logical statements meeting certain criteria over…

Formal Languages and Automata Theory · Computer Science 2019-08-23 Jonathan Rawski

Generic Ontology Design Patterns, GODPs, are defined in Generic DOL, an extension of DOL, the Distributed Ontology, Model and Specification Language, and implemented using Heterogeneous Tool Set. Parameters such as classes, properties,…

Artificial Intelligence · Computer Science 2019-06-21 Bernd Krieg-Brückner , Till Mossakowski , Fabian Neuhaus

Multilinear Grammar provides a framework for integrating the many different syntagmatic structures of language into a coherent semiotically based Rank Interpretation Architecture, with default linear grammars at each rank. The architecture…

Computation and Language · Computer Science 2017-09-18 Dafydd Gibbon , Sascha Griffiths

A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…

Logic · Mathematics 2025-07-16 Sergey Slavnov

Decision trees (DTs) epitomize the ideal of interpretability of machine learning (ML) models. The interpretability of decision trees motivates explainability approaches by so-called intrinsic interpretability, and it is at the core of…

Artificial Intelligence · Computer Science 2022-10-04 Yacine Izza , Alexey Ignatiev , Joao Marques-Silva

Math word problems form a natural abstraction to a range of quantitative reasoning problems, such as understanding financial news, sports results, and casualties of war. Solving such problems requires the understanding of several…

Computation and Language · Computer Science 2017-12-29 Subhro Roy , Dan Roth

After Dung's founding work in Abstract Argumentation Frameworks there has been a growing interest in extending the Dung's semantics in order to describe more complex or real life situations. Several of these approaches take the direction of…

Artificial Intelligence · Computer Science 2018-10-02 Theofrastos Mantadelis , Stefano Bistarelli

This paper explores the relationship between C++ templates and partial evaluation. Templates were designed to support generic programming, but unintentionally provided the ability to perform compile-time computations and code generation.…

Programming Languages · Computer Science 2007-05-23 Todd L. Veldhuizen

Families of objects appear in several contexts, like algebraic topology, theory of deformations, theoretical physics, etc. An unified coordinate-free algebraic framework for families of geometrical quantities is presented here, which allows…

Differential Geometry · Mathematics 2013-04-30 Giovanni Moreno

While many advances in time series models focus exclusively on numerical data, research on multimodal time series, particularly those involving contextual textual information, remains in its infancy. With recent progress in large language…

Machine Learning · Computer Science 2026-03-10 Zihao Li , Xiao Lin , Zhining Liu , Jiaru Zou , Ziwei Wu , Lecheng Zheng , Dongqi Fu , Yada Zhu , Hendrik Hamann , Hanghang Tong , Jingrui He

Ontologies formalise how the concepts from a given domain are interrelated. Despite their clear potential as a backbone for explainable AI, existing ontologies tend to be highly incomplete, which acts as a significant barrier to their more…

Artificial Intelligence · Computer Science 2021-05-12 Steven Schockaert , Yazmín Ibáñez-García , Víctor Gutiérrez-Basulto

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional…

Artificial Intelligence · Computer Science 2019-04-17 Katarina Britz , Giovanni Casini , Thomas Meyer , Kody Moodley , Uli Sattler , Ivan Varzinczak