English
Related papers

Related papers: Completeness and Decidability Properties for Funct…

200 papers

Runtime efficiency and termination are crucial properties in the studies of program verification. Instead of dealing with these issues in an ad hoc manner, it would be useful to develop a robust framework in which such properties are…

Programming Languages · Computer Science 2026-04-06 Weijun Chen , Yuxi Fu , Huan Long

Widespread use of artificial intelligence (AI) algorithms and machine learning (ML) models on the one hand and a number of crucial issues pertaining to them warrant the need for explainable artificial intelligence (XAI). A key…

Artificial Intelligence · Computer Science 2023-12-13 Jinqiang Yu , Graham Farr , Alexey Ignatiev , Peter J. Stuckey

Definition packages in theorem provers provide users with means of defining and organizing concepts of interest. This system description presents a new definition package for the hybrid systems theorem prover KeYmaera X based on…

Logic in Computer Science · Computer Science 2022-11-23 James Gallicchio , Yong Kiam Tan , Stefan Mitsch , André Platzer

In real life, data are often of poor quality as a result, for instance, of uncertainty, mismeasurements, missing values or bad inputs. This issue hampers an implicit yet crucial operation of every database management system: equality…

Logic in Computer Science · Computer Science 2024-04-30 Lhouari Nourine , Jean Marc Petit , Simon Vilmin

Ordinal regression predicts the objects' labels that exhibit a natural ordering, which is important to many managerial problems such as credit scoring and clinical diagnosis. In these problems, the ability to explain how the attributes…

Machine Learning · Computer Science 2019-11-15 Mengzhuo Guo , Zhongzhi Xu , Qingpeng Zhang , Xiuwu Liao , Jiapeng Liu

We present a prototype that implements a set of logical rules to prove the satisfiability for a class of specifications on XML documents. Specifications are given by means of constrains built on Boolean XPath patterns. The main goal of this…

Logic in Computer Science · Computer Science 2015-01-12 Javier Albors , Marisa Navarro

We introduce a logical foundation to reason on tree structures with constraints on the number of node occurrences. Related formalisms are limited to express occurrence constraints on particular tree regions, as for instance the children of…

Logic in Computer Science · Computer Science 2015-07-01 Everardo Bárcenas , Jesús Lavalle

XSLT is a standard rule-based programming language for expressing transformations of XML data. The language is currently in transition from version 1.0 to 2.0. In order to understand the computational consequences of this transition, we…

Programming Languages · Computer Science 2007-05-23 Wim Janssen , Alexandr Korlyukov , Jan Van den Bussche

Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this general setting, both the input and output schema as well as…

Databases · Computer Science 2007-05-23 Wim Martens , Frank Neven , Marc Gyssens

XrML is becoming a popular language in industry for writing software licenses. The semantics for XrML is implicitly given by an algorithm that determines if a permission follows from a set of licenses. We focus on a fragment of the language…

Cryptography and Security · Computer Science 2008-08-11 Joseph Y. Halpern , Vicky Weissman

This paper presents a novel approach for the integration of a set of XML Schemas. The proposed approach is specialized for XML, is almost automatic, semantic and "light". As a further, original, peculiarity, it is parametric w.r.t. a…

Databases · Computer Science 2009-11-19 P. De Meo , G. Quattrone , G. Terracina , D. Ursino

During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validity of produced data. Nowadays, a challenge is to assess and…

Programming Languages · Computer Science 2008-11-27 Pierre Genevès , Nabil Layaïda , Vincent Quint

We introduce xLLM, an intelligent and efficient Large Language Model (LLM) inference framework designed for high-performance, large-scale enterprise-grade serving, with deep optimizations for diverse AI accelerators. To address these…

Extensible markup language (XML) is a technology that has been much hyped, so that XML has become an industry buzzword. Behind the hype is a powerful technology for data representation in a platform independent manner. As a text document,…

Databases · Computer Science 2007-05-23 William F. Gilreath

XML keyword search is a user-friendly way to query XML data using only keywords. In XML keyword search, to achieve high precision without sacrificing recall, it is important to remove spurious results not intended by the user. Efforts to…

Databases · Computer Science 2009-11-24 Ki-Hoon Lee , Kyu-Young Whang , Wook-Shin Han , Min-Soo Kim

We investigate the problem of learning XML queries, path queries and tree pattern queries, from examples given by the user. A learning algorithm takes on the input a set of XML documents with nodes annotated by the user and returns a query…

Databases · Computer Science 2012-04-24 Sławomir Staworko , Piotr Wieczorek

We report about the current state of development of a document suite and its applications. This collection of tools for the flexible and robust processing of documents in German is based on the use of XML as unifying formalism for encoding…

Computation and Language · Computer Science 2007-05-23 Dietmar Roesner , Manuela Kunze

File systems play an essential role in modern society for managing precious data. To meet diverse needs, they often support many configuration parameters. Such flexibility comes at the price of additional complexity which can lead to subtle…

Operating Systems · Computer Science 2025-02-12 Tabassum Mahmud , Om Rameshwar Gatla , Duo Zhang , Carson Love , Ryan Bumann , Varun S Girimaji , Mai Zheng

We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…

Logic · Mathematics 2010-12-07 Hector Pasten , Thanases Pheidas , Xavier Vidaux

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