English
Related papers

Related papers: Typed Embedding of a Relational Language in OCaml

200 papers

Multimodal retrieval methods have limitations in handling complex, compositional queries that require reasoning about the visual content of both the query and the retrieved entities. On the other hand, Large Multimodal Models (LMMs) can…

Computer Vision and Pattern Recognition · Computer Science 2025-02-13 Maximilian Jaritz , Matthieu Guillaumin , Sabine Sternig , Loris Bazzani

This thesis concerns the implementation of Lambda Prolog, a higher-order logic programming language that supports the lambda-tree syntax approach to representing and manipulating formal syntactic objects. Lambda Prolog achieves its…

Programming Languages · Computer Science 2009-11-30 Xiaochu Qi

Categorical Message Passing Language (CaMPL) is a functional-style concurrent programming language whose semantics is in category theory, more specifically, linear actegories. Its core programming feature is message passing along typed…

Programming Languages · Computer Science 2026-05-12 Daniel Kiyoshi Hashimoto , Alexanna Little Berg , Priyaa Varshinee Srinivasan

Ontology, and more broadly, Knowledge Graph Matching is a challenging task in which expressiveness has not been fully addressed. Despite the increasing use of embeddings and language models for this task, approaches for generating…

Computation and Language · Computer Science 2025-02-20 Guilherme Sousa , Rinaldo Lima , Cassia Trojahn

Given a natural language phrase, relation linking aims to find a relation (predicate or property) from the underlying knowledge graph to match the phrase. It is very useful in many applications, such as natural language question answering,…

Artificial Intelligence · Computer Science 2019-10-25 Weiguo Zheng , Mei Zhang

We present a uniform approach for solving language inclusion problems. Our approach relies on a least fixpoint characterization and a quasiorder to compare words of the "smaller" language, reducing the inclusion check to a finite number of…

Formal Languages and Automata Theory · Computer Science 2024-04-16 Kyveli Doveri , Pierre Ganty , Chana Weil-Kennedy

The ability of Large Language Models (LLMs) to generate structured outputs that follow arbitrary schemas is crucial to a wide range of downstream tasks that require diverse structured representations of results such as information…

Computation and Language · Computer Science 2025-11-25 James Y. Huang , Wenxuan Zhou , Nan Xu , Fei Wang , Qin Liu , Sheng Zhang , Hoifung Poon , Muhao Chen

This article deals with OLAP systems based on multidimensional model. The conceptual model we provide, represents data through a constellation (multi-facts) composed of several multi-hierarchy dimensions. In this model, data are displayed…

Databases · Computer Science 2010-05-20 Franck Ravat , Olivier Teste , Gilles Zurfluh

Effective model-driven engineering of complex systems requires to appropriately describe different specific system aspects. To this end, efficient integration of different heterogeneous modeling languages is essential. Modeling language…

Software Engineering · Computer Science 2015-09-16 Arne Haber , Markus Look , Antonio Navarro Perez , Bernhard Rumpe , Steven Völkel , Andreas Wortmann

The pivotal role that event correlation technology plays in todays applications has lead to the emergence of different families of event correlation approaches with a multitude of specialized correlation semantics, including computation…

Programming Languages · Computer Science 2019-07-09 Oliver Bračevac , Guido Salvaneschi , Sebastian Erdweg , Mira Mezini

In this paper we describe how to leverage higher-order unification to type check a dependently typed language with meta-variables. The literature usually presents the unification algorithm as a standalone component, however the need to…

Programming Languages · Computer Science 2016-10-03 Francesco Mazzoli , Andreas Abel

We define two extensions of the typed linear lambda-calculus that yield minimal Turing-complete systems. The extensions are based on unbounded recursion in one case, and bounded recursion with minimisation in the other. We show that both…

Logic in Computer Science · Computer Science 2016-11-28 Sandra Alves , Maribel Fernández , Mário Florido , Ian Mackie

Last year, multimodal architectures served up a revolution in AI-based approaches and solutions, extending the capabilities of large language models (LLM). We propose an \textit{OmniFusion} model based on a pretrained LLM and adapters for…

Computer Vision and Pattern Recognition · Computer Science 2024-04-10 Elizaveta Goncharova , Anton Razzhigaev , Matvey Mikhalchuk , Maxim Kurkin , Irina Abdullaeva , Matvey Skripkin , Ivan Oseledets , Denis Dimitrov , Andrey Kuznetsov

In this essay, I present the advantages and, I dare say, the beauty of programming in a language with set-theoretic types, that is, types that include union, intersection, and negation type connectives. I show by several examples how…

Programming Languages · Computer Science 2024-11-18 Giuseppe Castagna

Multiple logic-based reconstructions of conceptual data modelling languages such as EER, UML Class Diagrams, and ORM exist. They mainly cover various fragments of the languages and none are formalised such that the logic applies…

Artificial Intelligence · Computer Science 2019-09-20 Pablo Rubén Fillottrani , C. Maria Keet

Optimization problems are pervasive in sectors from manufacturing and distribution to healthcare. However, most such problems are still solved heuristically by hand rather than optimally by state-of-the-art solvers because the expertise…

Artificial Intelligence · Computer Science 2025-08-29 Ali AhmadiTeshnizi , Wenzhi Gao , Herman Brunborg , Shayan Talaei , Connor Lawless , Madeleine Udell

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

Modern NLP models rely heavily on engineered features, which often combine word and contextual information into complex lexical features. Such combination results in large numbers of features, which can lead to over-fitting. We present a…

Computation and Language · Computer Science 2016-04-05 Mo Yu , Mark Dredze , Raman Arora , Matthew Gormley

Large language models (LLMs) under-perform on low-resource languages due to limited training data. We present a method to efficiently collect text data for low-resource languages from the entire Common Crawl corpus. Our approach,…

Computation and Language · Computer Science 2024-11-22 Bethel Melesse Tessema , Akhil Kedia , Tae-Sun Chung

Forms are a common type of document in real life and carry rich information through textual contents and the organizational structure. To realize automatic processing of forms, word grouping and relation extraction are two fundamental and…

Computation and Language · Computer Science 2021-05-12 Zilong Wang , Mingjie Zhan , Houxing Ren , Zhaohui Hou , Yuwei Wu , Xingyan Zhang , Ding Liang
‹ Prev 1 4 5 6 7 8 10 Next ›