Results 1 to 10 of about 92,734 (332)
Term Graph Rewriting and Parallel Term Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing.
Andrea Corradini, Frank Drewes
doaj +5 more sources
String Diagram Rewrite Theory II: Rewriting with Symmetric Monoidal Structure [PDF]
Mathematical Structures in Computer Science, 2021 Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them suitable to express resource-sensitive systems, in which variables cannot be copied or discarded at will. In SMTs, traditional tree-like terms are replaced by string
Filippo Bonchi +4 more
openalex +3 more sources
Rewriting with Acyclic Queries: Mind Your Head [PDF]
Logical Methods in Computer Science, 2023 The paper studies the rewriting problem, that is, the decision problem whether, for a given conjunctive query $Q$ and a set $\mathcal{V}$ of views, there is a conjunctive query $Q'$ over $\mathcal{V}$ that is equivalent to $Q$, for cases where the query,
Gaetano Geck +3 more
doaj +1 more source
Query Rewriting for Retrieval-Augmented Large Language Models [PDF]
arXiv.org, 2023 Large Language Models (LLMs) play powerful, black-box readers in the retrieve-then-read pipeline, making remarkable progress in knowledge-intensive tasks.
Xinbei Ma +4 more
semanticscholar +1 more source
Large Language Model based Long-tail Query Rewriting in Taobao Search [PDF]
The Web Conference, 2023 In the realm of e-commerce search, the significance of semantic matching cannot be overstated, as it directly impacts both user experience and company revenue.
Wenjun Peng +7 more
semanticscholar +1 more source
RewriteLM: An Instruction-Tuned Large Language Model for Text Rewriting [PDF]
AAAI Conference on Artificial Intelligence, 2023 Large Language Models (LLMs) have demonstrated impressive capabilities in creative tasks such as storytelling and E-mail generation. However, as LLMs are primarily trained on final text results rather than intermediate revisions, it might be challenging ...
Lei Shu +7 more
semanticscholar +1 more source
CONQRR: Conversational Query Rewriting for Retrieval with Reinforcement Learning [PDF]
Conference on Empirical Methods in Natural Language Processing, 2021 Compared to standard retrieval tasks, passage retrieval for conversational question answering (CQA) poses new challenges in understanding the current user question, as each question needs to be interpreted within the dialogue context. Moreover, it can be
Zeqiu Wu +4 more
semanticscholar +1 more source
Reinforced Question Rewriting for Conversational Question Answering [PDF]
Conference on Empirical Methods in Natural Language Processing, 2022 Conversational Question Answering (CQA) aims to answer questions contained within dialogues, which are not easily interpretable without context. Developing a model to rewrite conversational questions into self-contained ones is an emerging solution in ...
Zhiyu Chen +5 more
semanticscholar +1 more source
Modes of Convergence for Term Graph Rewriting [PDF]
Logical Methods in Computer Science, 2012 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.
Patrick Bahr
doaj +1 more source
Rewriting and Well-Definedness within a Proof System [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting.
Issam Maamria, Michael Butler
doaj +1 more source