English
Related papers

Related papers: ACD Term Rewriting

200 papers

Retrieval-augmented generation (RAG) enhances large language models (LLMs) with external knowledge but incurs significant inference costs due to lengthy retrieved contexts. While context compression mitigates this issue, existing methods…

Computation and Language · Computer Science 2025-09-25 Shuyu Guo , Shuo Zhang , Zhaochun Ren

Rule-based reasoning is an essential part of human intelligence prominently formalized in artificial intelligence research via logic programs. Describing complex objects as the composition of elementary ones is a common strategy in computer…

Artificial Intelligence · Computer Science 2023-12-15 Christian Antic

When used in high-stakes settings, AI systems are expected to produce decisions that are transparent, interpretable and auditable, a requirement increasingly expected by regulations. Decision trees such as CART provide clear and verifiable…

Machine Learning · Computer Science 2026-04-07 Vincent Grari , Tim Arni , Thibault Laugel , Sylvain Lamprier , James Zou , Marcin Detyniecki

Large language models are increasingly used within larger systems ("LLM agents"). These make a sequence of LLM calls, each call providing the LLM with a combination of instructions, observations, and interaction history. The design of the…

Artificial Intelligence · Computer Science 2026-05-05 Noga Peleg Pelc , Gal A. Kaminka , Yoav Goldberg

Recently, in order to mix algebraic and logic styles of specification in a uniform framework, the notion of a logic labelled transition system (Logic LTS or LLTS for short) has been introduced and explored. A variety of constructors over…

Logic in Computer Science · Computer Science 2019-02-20 Yan Zhang , Zhaohui Zhu , Jinjin Zhang

Rewriting is a common approach to logic optimization based on local transformations. Most commercially available logic synthesis tools include a rewriting engine that may be used multiple times on the same netlist during optimization. This…

Logic in Computer Science · Computer Science 2011-08-19 Nan Li , Elena Dubrova

Term graph rewriting provides a simple mechanism to finitely represent restricted forms of infinitary term rewriting. The correspondence between infinitary term rewriting and term graph rewriting has been studied to some extent. However,…

Logic in Computer Science · Computer Science 2015-07-01 Patrick Bahr

Recursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, called flexible coinduction, to express a variety of intermediate interpretations,…

Programming Languages · Computer Science 2020-09-23 Francesco Dagnino , Davide Ancona , Elena Zucca

Large language model agents that use external tools are often implemented through reactive execution, in which reasoning is repeatedly recomputed after each observation, increasing latency and sensitivity to error propagation. This work…

Artificial Intelligence · Computer Science 2026-04-07 Paulo Akira F. Enabe

A main research goal in various studies is to use an observational data set and provide a new set of counterfactual guidelines that can yield causal improvements. Dynamic Treatment Regimes (DTRs) are widely studied to formalize this…

Machine Learning · Computer Science 2023-06-06 Soroush Saghafian

Language agents have demonstrated autonomous decision-making abilities by reasoning with foundation models. Recently, efforts have been made to train language agents for performance improvement, with multi-step reasoning and action…

Artificial Intelligence · Computer Science 2024-04-02 Zonghan Yang , Peng Li , Ming Yan , Ji Zhang , Fei Huang , Yang Liu

Confluence of a nondeterministic program ensures a functional input-output relation, freeing the programmer from considering the actual scheduling strategy, and allowing optimized and perhaps parallel implementations. The more general…

Programming Languages · Computer Science 2018-09-14 Henning Christiansen , Maja Kirkeby

We observe that the various formulations of the operational semantics of Constraint Handling Rules proposed over the years fall into a spectrum ranging from the analytical to the pragmatic. While existing analytical formulations facilitate…

Logic in Computer Science · Computer Science 2010-07-23 Hariolf Betz , Frank Raiser , Thom Frühwirth

The rewriting method for text summarization combines extractive and abstractive approaches, improving the conciseness and readability of extractive summaries using an abstractive model. Exiting rewriting systems take each extractive…

Computation and Language · Computer Science 2022-07-14 Guangsheng Bao , Yue Zhang

This note presents a method of interpreting the tree adjoining languages as the natural third step in a hierarchy that starts with the regular and the context-free languages. The central notion in this account is that of a higher-order…

cmp-lg · Computer Science 2008-02-03 Uwe Moennich

DATR is a declarative representation language for lexical information and as such, in principle, neutral with respect to particular processing strategies. Previous DATR compiler/interpreter systems support only one access strategy that…

cmp-lg · Computer Science 2008-02-03 Hagen Langer

Recently, it has been shown that every recursively enumerable language can be generated by a scattered context grammar with no more than three nonterminals. However, in that construction, the maximal number of nonterminals simultaneously…

Formal Languages and Automata Theory · Computer Science 2009-07-30 Tomáš Masopust , Alexander Meduna

In recent years, with the development of deep learning, text generation technology has undergone great changes and provided many kinds of services for human beings, such as restaurant reservation and daily communication. The automatically…

Computation and Language · Computer Science 2020-12-25 Bin Guo , Hao Wang , Yasan Ding , Wei Wu , Shaoyang Hao , Yueqi Sun , Zhiwen Yu

Code translation is a crucial process in software development and migration projects, enabling interoperability between different programming languages and enhancing software adaptability and thus longevity. Traditional automated…

Artificial Intelligence · Computer Science 2025-07-23 Shreya Saxena , Siva Prasad , Zishan Ahmad , Vishal Vaddina

Text Simplification improves the readability of sentences through several rewriting transformations, such as lexical paraphrasing, deletion, and splitting. Current simplification systems are predominantly sequence-to-sequence models that…

Computation and Language · Computer Science 2021-04-16 Mounica Maddela , Fernando Alva-Manchego , Wei Xu