English
Related papers

Related papers: Completeness and Decidability Properties for Funct…

200 papers

Most modern libraries for regular expression matching allow back-references (i.e., repetition operators) that substantially increase expressive power, but also lead to intractability. In order to find a better balance between expressiveness…

Formal Languages and Automata Theory · Computer Science 2018-02-06 Dominik D. Freydenberger , Markus L. Schmid

The continuous growth in the XML information repositories has been matched by increasing efforts in development of XML retrieval systems, in large parts aiming at supporting content-oriented XML retrieval. These systems exploit the…

Information Retrieval · Computer Science 2011-11-29 Awny Sayed

There have been many proposals for access control models and authorization policy languages, which are used to inform the design of access control systems. Most, if not all, of these proposals impose restrictions on the implementation of…

Cryptography and Security · Computer Science 2014-08-01 Jason Crampton , Charles Morisset

Explainable Artificial Intelligence (XAI) has become popular in the last few years. The Artificial Intelligence (AI) community in general, and the Machine Learning (ML) community in particular, is coming to the realisation that in many…

Artificial Intelligence · Computer Science 2026-02-24 Raymond Sheh , Isaac Monteath

We consider the (one-dimensional) array counterpart of contextual as well as insertion and deletion string grammars and consider the operations of array insertion and deletion in array grammars. First we show that the emptiness problem for…

Formal Languages and Automata Theory · Computer Science 2013-09-06 Rudolf Freund , Sergiu Ivanov , Marion Oswald , K. G. Subramanian

ODRL is a popular XML-based language for stating the conditions under which resources can be accessed legitimately. The language is described in English and, as a result, agreements written in ODRL are open to interpretation. To address…

Logic in Computer Science · Computer Science 2007-05-23 Riccardo Pucella , Vicky Weissman

This paper addresses the challenge of improving information retrieval from semi-structured eXtensible Markup Language (XML) documents. Traditional information retrieval systems (IRS) often overlook user-specific needs and return identical…

Information Retrieval · Computer Science 2026-03-24 Ounnaci Iddir , Ahmed-ouamer Rachid , Tai Dinh

The notion of non-deterministic logical matrix (where connectives are interpreted as multi-functions) preserves many good properties of traditional semantics based on logical matrices (where connectives are interpreted as functions) whilst…

Logic in Computer Science · Computer Science 2022-04-15 Pedro Filipe , Carlos Caleiro , Sérgio Marcelino

We define XPathLog as a Datalog-style extension of XPath. XPathLog provides a clear, declarative language for querying and manipulating XML whose perspectives are especially in XML data integration. In our characterization, the formal…

Databases · Computer Science 2007-05-23 Wolfgang May

Shapley values have become one of the go-to methods to explain complex models to end-users. They provide a model agnostic post-hoc explanation with foundations in game theory: what is the worth of a player (in machine learning, a feature…

Machine Learning · Computer Science 2023-06-21 Joran Michiels , Maarten De Vos , Johan Suykens

We present an approach to develop folds for nested data types using dependent types. We call such folds $\textit{dependently typed folds}$, they have the following properties. (1) Dependently typed folds are defined by well-founded…

Logic in Computer Science · Computer Science 2018-06-18 Peng Fu , Peter Selinger

We propose the vision of a functional data model (FDM) and an associated functional query language (FQL). Our proposal has far-reaching consequences: we show a path to come up with a modern QL that solves (almost if not) all problems of SQL…

Databases · Computer Science 2025-07-29 Jens Dittrich

Modern logics of dependence and independence are based on team semantics, which means that formulae are evaluated not on a single assignment of values to variables, but on a set of such assignments, called a team. This leads to high…

Logic in Computer Science · Computer Science 2021-02-23 Erich Grädel , Phil Pützstück

Conceptual dependencies (CDs) are particular kinds of key dependencies (KDs) and inclusion dependencies (IDs) that precisely characterize relational schemata modeled according to the main features of the Entity-Relationship (ER) model. An…

Databases · Computer Science 2013-12-10 Davide Martinenghi

Determining functionals are tools to describe the finite dimensional long-term dynamics of infinite dimensional dynamical systems. There also exist several applications to infinite dimensional {\em random} dynamical systems. In these…

Dynamical Systems · Mathematics 2016-08-16 Igor Chueshov , Jinqiao Duan , Björn Schmalfuß

Team Semantics generalizes Tarski's Semantics by defining satisfaction with respect to sets of assignments rather than with respect to single assignments. Because of this, it is possible to use Team Semantics to extend First Order Logic via…

Logic · Mathematics 2022-07-01 Pietro Galliani

While keyword query empowers ordinary users to search vast amount of data, the ambiguity of keyword query makes it difficult to effectively answer keyword queries, especially for short and vague keyword queries. To address this challenging…

Databases · Computer Science 2013-01-14 Jianxin Li , Chengfei Liu , Liang Yao , Jeffrey Xu Yu

Functional and inclusion dependencies are the most widely used classes of data dependencies in data profiling due to their ability to identify relationships in data such as primary and foreign keys. These relationships are equally important…

Databases · Computer Science 2021-11-23 Michael J. Mior

The processing of XML documents often includes creation and validation. These two operations are typically performed in two different nodes within a computer network that do not correlate with each other. The process of creation is also…

Logic in Computer Science · Computer Science 2019-06-21 René Haberland

Functional dependencies are an integral part of database design. However, they are only defined when we exclude null markers. Yet we commonly use null markers in practice. To bridge this gap between theory and practice, researchers have…

Databases · Computer Science 2015-05-18 Antonio Badia , Daniel Lemire
‹ Prev 1 4 5 6 7 8 10 Next ›