Journal articles: 'Rewriting techniques'

1

GIESL, JÜRGEN, and AART MIDDELDORP. "Transformation techniques for context-sensitive rewrite systems." Journal of Functional Programming 14, no. 4 (June 7, 2004): 379–427. http://dx.doi.org/10.1017/s0956796803004945.

Full text

Abstract:

Context-sensitive rewriting is a computational restriction of term rewriting used to model non-strict (lazy) evaluation in functional programming. The goal of this paper is the study and development of techniques to analyze the termination behavior of context-sensitive rewrite systems. For that purpose, several methods have been proposed in the literature which transform context-sensitive rewrite systems into ordinary rewrite systems such that termination of the transformed ordinary system implies termination of the original context-sensitive system. In this way, the huge variety of existing techniques for termination analysis of ordinary rewriting can be used for context-sensitive rewriting, too. We analyze the existing transformation techniques for proving termination of context-sensitive rewriting and we suggest two new transformations. Our first method is simple, sound, and more powerful than the previously proposed transformations. However, it is not complete, i.e., there are terminating context-sensitive rewrite systems that are transformed into non-terminating term rewrite systems. The second method that we present in this paper is both sound and complete. All these observations also hold for rewriting modulo associativity and commutativity.

APA, Harvard, Vancouver, ISO, and other styles

2

Carral, David, Larry González, and Patrick Koopmann. "From Horn-SRIQ to Datalog: A Data-Independent Transformation That Preserves Assertion Entailment." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2736–43. http://dx.doi.org/10.1609/aaai.v33i01.33012736.

Full text

Abstract:

Ontology-based access to large data-sets has recently gained a lot of attention. To access data efficiently, one approach is to rewrite the ontology into Datalog, and then use powerful Datalog engines to compute implicit entailments. Existing rewriting techniques support Description Logics (DLs) from ELH to Horn-SHIQ. We go one step further and present one such data-independent rewriting technique for Horn-SRIQ⊓, the extension of Horn-SHIQ that supports role chain axioms, an expressive feature prominently used in many real-world ontologies. We evaluated our rewriting technique on a large known corpus of ontologies. Our experiments show that the resulting rewritings are of moderate size, and that our approach is more efficient than state-of-the-art DL reasoners when reasoning with data-intensive ontologies.

APA, Harvard, Vancouver, ISO, and other styles

3

Kirchner, Hélène, and Pierre Lescanne. "Rewriting techniques and applications, RTA'91." ACM SIGACT News 22, no. 3 (June 1991): 24–30. http://dx.doi.org/10.1145/126537.126539.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Millen, Jonathan. "Rewriting Techniques in the Constraint Solver." Electronic Notes in Theoretical Computer Science 234 (March 2009): 77–91. http://dx.doi.org/10.1016/j.entcs.2009.02.073.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Roşu, Grigore, and Klaus Havelund. "Rewriting-Based Techniques for Runtime Verification." Automated Software Engineering 12, no. 2 (April 2005): 151–97. http://dx.doi.org/10.1007/s10515-005-6205-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Gazeau, Ivan, Dale Miller, and Catuscia Palamidessi. "Non-local Robustness Analysis via Rewriting Techniques." Electronic Proceedings in Theoretical Computer Science 103 (December 14, 2012): 65. http://dx.doi.org/10.4204/eptcs.103.8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Venetis, Tassos, Giorgos Stoilos, and Vasilis Vassalos. "Rewriting Minimizations for Efficient Query Answering over Ontologies." International Journal on Artificial Intelligence Tools 26, no. 05 (October 2017): 1760024. http://dx.doi.org/10.1142/s0218213017600247.

Full text

Abstract:

Computing a (Union of Conjunctive Queries — UCQ) rewriting ℛ for an input query and ontology and evaluating it over the given dataset is a prominent approach to query answering over ontologies. However, ℛ can be large and complex in structure hence additional techniques, like query subsumption and data constraints, need to be employed in order to minimize ℛ and lead to an efficient evaluation. Although sound in theory, how to efficiently and effectively implement many of these techniques in practice could be challenging. For example, many systems do not implement query subsumption. In the current paper we present several practical techniques for UCQ rewriting minimization. First, we present an optimized algorithm for eliminating redundant (w.r.t. subsumption) queries as well as a novel framework for rewriting minimization using data constraints. Second, we show how these techniques can also be used to speed up the computation of ℛ in first place. Third, we integrated all our techniques in our query rewriting system IQAROS and conducted an extensive experimental evaluation using many artificial as well as challenging real-world ontologies obtaining encouraging results as, in the vast majority of cases, our system is more efficient compared to the two most popular state-of-the-art systems.

APA, Harvard, Vancouver, ISO, and other styles

8

Ambite, J. L., and C. A. Knoblock. "Planning by Rewriting." Journal of Artificial Intelligence Research 15 (September 1, 2001): 207–61. http://dx.doi.org/10.1613/jair.754.

Full text

Abstract:

Domain-independent planning is a hard combinatorial problem. Taking into account plan quality makes the task even more difficult. This article introduces Planning by Rewriting (PbR), a new paradigm for efficient high-quality domain-independent planning. PbR exploits declarative plan-rewriting rules and efficient local search techniques to transform an easy-to-generate, but possibly suboptimal, initial plan into a high-quality plan. In addition to addressing the issues of planning efficiency and plan quality, this framework offers a new anytime planning algorithm. We have implemented this planner and applied it to several existing domains. The experimental results show that the PbR approach provides significant savings in planning effort while generating high-quality plans.

APA, Harvard, Vancouver, ISO, and other styles

9

De Sutter, Bjorn, Bruno De Bus, and Koen De Bosschere. "Link-time binary rewriting techniques for program compaction." ACM Transactions on Programming Languages and Systems 27, no. 5 (September 2005): 882–945. http://dx.doi.org/10.1145/1086642.1086645.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Greco, Sergio, Francesca Spezzano, and Irina Trubitsyna. "Checking Chase Termination: Cyclicity Analysis and Rewriting Techniques." IEEE Transactions on Knowledge and Data Engineering 27, no. 3 (March 1, 2015): 621–35. http://dx.doi.org/10.1109/tkde.2014.2339816.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Bunsen, Masatoshi, Hirosuke Furuta, Kuniaki Aragane, and Atsushi Okamoto. "Improved Holographic Recording Techniques for Data-Page Rewriting." Japanese Journal of Applied Physics 47, no. 7 (July 18, 2008): 5977–80. http://dx.doi.org/10.1143/jjap.47.5977.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

BOULTON, RICHARD J. "Transparent optimisation of rewriting combinators." Journal of Functional Programming 9, no. 2 (March 1999): 113–46. http://dx.doi.org/10.1017/s0956796899003391.

Full text

Abstract:

The LCF system was the first mechanical theorem prover to be user-programmable via a metalanguage, ML, from which the functional programming language Standard ML has been developed. Paulson has demonstrated how a modular rewriting engine can be implemented in LCF. This provides both clarity and flexibility. This paper shows that the same modular approach (using higher-order functions) allows transparent optimisation of the rewriting engine; performance can be improved while few, if any, changes are required to code written using these functions. The techniques described have been implemented in the HOL system, a descendant of LCF, and some are now in daily use. Comparative results are given. Some of the techniques described, in particular ones to avoid processing parts of a data structure that do not need to be changed, may be of more general use in functional programming and beyond.

APA, Harvard, Vancouver, ISO, and other styles

13

ECHAHED, RACHID. "Foreword: special issue on term and graph rewriting." Mathematical Structures in Computer Science 28, no. 8 (July 6, 2018): 1287–89. http://dx.doi.org/10.1017/s0960129518000191.

Full text

Abstract:

Rewriting techniques constitute a foundational theory of computing science. They are being investigated for several structures, such as lambda-terms, strings, first-order terms or graphs, and have been successfully used in many areas such as programming languages, automated reasoning, program verification, security, etc. The growing interest in this research area is witnessed by the leading international events, such as ICGT (International Conference on Graph Transformation) and the recent FSCD conference (International Conference on Formal Structures for Computation and Deduction), which gathers all topics of the former international conferences RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications). During the last decade, a particular interest has been devoted to the study of the impact of shared structures in term and graph rewriting through the international workshops editions of TERMGRAPH and GCM (Graph Computation Models).

APA, Harvard, Vancouver, ISO, and other styles

14

KIRCHNER, HÉLÈNE, and PIERRE-ETIENNE MOREAU. "Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories." Journal of Functional Programming 11, no. 2 (March 2001): 207–51. http://dx.doi.org/10.1017/s0956796800003907.

Full text

Abstract:

First-order languages based on rewrite rules share many features with functional languages, but one difference is that matching and rewriting can be made much more expressive and powerful by incorporating some built-in equational theories. To provide reasonable programming environments, compilation techniques for such languages based on rewriting have to be designed. This is the topic addressed in this paper. The proposed techniques are independent from the rewriting language, and may be useful to build a compiler for any system using rewriting modulo Associative and Commutative (AC) theories. An algorithm for many-to-one AC matching is presented, that works efficiently for a restricted class of patterns. Other patterns are transformed to fit into this class. A refined data structure, namely compact bipartite graph, allows encoding of all matching problems relative to a set of rewrite rules. A few optimisations concerning the construction of the substitution and of the reduced term are described. We also address the problem of non-determinism related to AC rewriting, and show how to handle it through the concept of strategies. We explain how an analysis of the determinism can be performed at compile time, and we illustrate the benefits of this analysis for the performance of the compiled evaluation process. Then we briefly introduce the ELAN system and its compiler, in order to give some experimental results and comparisons with other languages or rewrite engines.

APA, Harvard, Vancouver, ISO, and other styles

15

Benedikt, Michael, Maxime Buron, Stefano Germano, Kevin Kappelmann, and Boris Motik. "Rewriting the infinite chase." Proceedings of the VLDB Endowment 15, no. 11 (July 2022): 3045–57. http://dx.doi.org/10.14778/3551793.3551851.

Full text

Abstract:

Guarded tuple-generating dependencies (GTGDs) are a natural extension of description logics and referential constraints. It has long been known that queries over GTGDs can be answered by a variant of the chase ---a quintessential technique for reasoning with dependencies. However, there has been little work on concrete algorithms and even less on implementation. To address this gap, we revisit Datalog rewriting approaches to query answering, where GTGDs are transformed to a Datalog program that entails the same base facts on each base instance. We show that the rewriting can be seen as containing "shortcut" rules that circumvent certain chase steps, we present several algorithms that compute the rewriting by simulating specific types of chase steps, and we discuss important implementation issues. Finally, we show empirically that our techniques can process complex GTGDs derived from synthetic and real benchmarks and are thus suitable for practical use.

APA, Harvard, Vancouver, ISO, and other styles

16

Greco, Sergio, Francesca Spezzano, and Irina Trubitsyna. "Stratification criteria and rewriting techniques for checking chase termination." Proceedings of the VLDB Endowment 4, no. 11 (August 2011): 1158–68. http://dx.doi.org/10.14778/3402707.3402750.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Kanovich, Max. "Finding direct partition bijections by two-directional rewriting techniques." Discrete Mathematics 285, no. 1-3 (August 2004): 151–66. http://dx.doi.org/10.1016/j.disc.2004.01.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Papadopoulos, George A. "Concurrent object-oriented programming using term graph rewriting techniques." Information and Software Technology 38, no. 8 (January 1996): 539–47. http://dx.doi.org/10.1016/0950-5849(96)01093-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Imprialou, Martha, Giorgos Stoilos, and Bernardo Cuenca Grau. "Benchmarking Ontology-Based Query Rewriting Systems." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (September 20, 2021): 779–85. http://dx.doi.org/10.1609/aaai.v26i1.8215.

Full text

Abstract:

Query rewriting is a prominent reasoning technique in ontology-based data access applications. A wide variety of query rewriting algorithms have been proposed in recent years and implemented in highly optimised reasoning systems. Query rewriting systems are complex software programs; even if based on provably correct algorithms, sophisticated optimisations make the systems more complex and errors become more likely to happen. In this paper, we present an algorithm that, given an ontology as input, synthetically generates ``relevant'' test queries. Intuitively, each of these queries can be used to verify whether the system correctly performs a certain set of ``inferences'', each of which can be traced back to axioms in the input ontology. Furthermore, we present techniques that allow us to determine whether a system is unsound and/or incomplete for a given test query and ontology. Our evaluation shows that most publicly available query rewriting systems are unsound and/or incomplete, even on commonly used benchmark ontologies; more importantly, our techniques revealed the precise causes of their correctness issues and the systems were then corrected based on our feedback. Finally, since our evaluation is based on a larger set of test queries than existing benchmarks, which are based on hand-crafted queries, it also provides a better understanding of the scalability behaviour of each system.

APA, Harvard, Vancouver, ISO, and other styles

20

Baziotis, Stefanos, Daniel Kang, and Charith Mendis. "Dias: Dynamic Rewriting of Pandas Code." Proceedings of the ACM on Management of Data 2, no. 1 (March 12, 2024): 1–27. http://dx.doi.org/10.1145/3639313.

Full text

Abstract:

In recent years, dataframe libraries, such as pandas have exploded in popularity. Due to their flexibility, they are increasingly used in ad-hoc exploratory data analysis (EDA) workloads. These workloads are diverse, including custom functions which can span libraries or be written in pure Python. The majority of systems available to accelerate EDA workloads focus on bulk-parallel workloads, which contain vastly different computational patterns, typically within a single library. As a result, they can introduce excessive overheads for ad-hoc EDA workloads due to their expensive optimization techniques. Instead, we identify source-to-source, external program rewriting as a lightweight technique which can optimize across representations, and offer substantial speedups while also avoiding slowdowns. We implemented Dias, which rewrites notebook cells to be more efficient for ad-hoc EDA workloads. We develop techniques for efficient rewrites in Dias, including checking the preconditions under which rewrites are correct, dynamically, at fine-grained program points. We show that Dias can rewrite individual cells to be 57× faster compared to pandas and 1909× faster compared to optimized systems such as modin. Furthermore, Dias can accelerate whole notebooks by up to 3.6× compared to pandas and 27.1× compared to modin.

APA, Harvard, Vancouver, ISO, and other styles

21

Kremer, Steve, and Paliath Narendran. "Foreword to the special issue on security and rewriting techniques." Information and Computation 238 (November 2014): 1. http://dx.doi.org/10.1016/j.ic.2014.07.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Göbel, Manfred. "Rewriting Techniques and Degree Bounds for Higher Order Symmetric Polynomials." Applicable Algebra in Engineering, Communication and Computing 9, no. 6 (July 1, 1999): 559–73. http://dx.doi.org/10.1007/s002000050118.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Dong, Rui, Jie Liu, Yuxuan Zhu, Cong Yan, Barzan Mozafari, and Xinyu Wang. "SlabCity: Whole-Query Optimization Using Program Synthesis." Proceedings of the VLDB Endowment 16, no. 11 (July 2023): 3151–64. http://dx.doi.org/10.14778/3611479.3611515.

Full text

Abstract:

Query rewriting is often a prerequisite for effective query optimization, particularly for poorly-written queries. Prior work on query rewriting has relied on a set of "rules" based on syntactic pattern-matching. Whether relying on manual rules or auto-generated ones, rule-based query rewriters are inherently limited in their ability to handle new query patterns. Their success is limited by the quality and quantity of the rules provided to them. To our knowledge, we present the first synthesis-based query rewriting technique, SlabCity, capable of whole-query optimization without relying on any rewrite rules. SlabCity directly searches the space of SQL queries using a novel query synthesis algorithm that leverages a new concept called query dataflows. We evaluate SlabCity on four workloads, including a newly curated benchmark with more than 1000 real-life queries. We show that not only can SlabCity optimize more queries than state-of-the-art query rewriting techniques, but interestingly, it also leads to queries that are significantly faster than those generated by rule-based systems.

APA, Harvard, Vancouver, ISO, and other styles

24

Rilett Wood, Joyce. "Writing and Rewriting of Psalm 22." Studies in Religion/Sciences Religieuses 48, no. 2 (June 2019): 189–215. http://dx.doi.org/10.1177/0008429819830071.

Full text

Abstract:

Rewriting has converted a personal lament psalm into a complex literary work with diverse topics and themes, with distinct genres and settings, and with opposite and contradictory meanings. We can discover the original psalm by unravelling the editorial process and by observing the revision techniques of repetition, reversal and cross reference. What characterizes the second edition of the psalm is a gradual shift from individual experience to the concerns of the whole community. The reviser draws on historical tradition to transform the earlier composition into a new story with an entirely different theological perspective.

APA, Harvard, Vancouver, ISO, and other styles

25

COHEN, DANIEL E. "String rewriting and homology of monoids." Mathematical Structures in Computer Science 7, no. 3 (June 1997): 207–40. http://dx.doi.org/10.1017/s0960129596002149.

Full text

Abstract:

Results of Anick (1986), Squier (1987), Kobayashi (1990), Brown (1992b), and others, show that a monoid with a finite convergent rewriting system satisfies a homological condition known as FP∞.In this paper we give a simplified version of Brown's proof, which is conceptual, in contrast with the other proofs, which are computational.We also collect together a large number of results and examples of monoids and groups that satisfy FP∞ and others that do not. These may provide techniques for showing that various monoids do not have finite convergent rewriting systems, as well as explicit examples with which methods can be tested.

APA, Harvard, Vancouver, ISO, and other styles

26

YVON, FRANÇOIS. "Rewriting the orthography of SMS messages." Natural Language Engineering 16, no. 2 (March 24, 2010): 133–59. http://dx.doi.org/10.1017/s1351324909990258.

Full text

Abstract:

AbstractElectronic written texts used in computer-mediated interactions (emails, blogs, chats, and the like) contain significant deviations from the norm of the language. This paper presents the detail of a system aiming at normalizing the orthography of French SMS messages: after discussing the linguistic peculiarities of these messages and possible approaches to their automatic normalization, we present, compare, and evaluate various instanciations of a normalization device based on weighted finite-state transducers. These experiments show that using an intermediate phonemic representation and training, our system outperforms an alternative normalization system based on phrase-based statistical machine translation techniques.

APA, Harvard, Vancouver, ISO, and other styles

27

Rodriguez, Olivier, Federico Ulliana, and Marie-Laure Mugnier. "Scalable Reasoning on Document Stores via Instance-Aware Query Rewriting." Proceedings of the VLDB Endowment 16, no. 11 (July 2023): 2699–713. http://dx.doi.org/10.14778/3611479.3611481.

Full text

Abstract:

Data trees, typically encoded in JSON, are ubiquitous in data-driven applications. This ubiquity makes urgent the development of novel techniques for querying heterogeneous JSON data in a flexible manner. We propose a rule language for JSON, called constrained tree-rules, whose purpose is to provide a high-level unified view of heterogeneous JSON data and infer implicit information. As reasoning with constrained tree-rules is undecidable, we identify a relevant subset featuring tractable query answering, for which we design an automata-based query rewriting algorithm. Our approach consists of leveraging NoSQL document stores by means of a novel instance-aware query-rewriting technique. We present an extensive experimental analysis on large collections of several million JSON records. Our results show the importance of instance-aware rewriting as well as the efficiency and scalability of our approach.

APA, Harvard, Vancouver, ISO, and other styles

28

Elimam, Fatima. "Translation: Practicing Rewriting in Context." European Journal of Contemporary Education and E-Learning 2, no. 1 (January 1, 2024): 253–56. http://dx.doi.org/10.59324/ejceel.2024.2(1).21.

Full text

Abstract:

Translation serves to provide a natural context in which a translator practices the role of a second writer. This natural writing environment accumulates the experience as well as the expertise of applying various translation and linguistic theories to tackle textual problems, being them lexical, semantic, cultural or merely grammatical. Translation is the only field in which two languages are consciously and unconsciously practiced at the whole levels throughout the translation activity. Written texts that require translation ought to be understood by translators as the starting point for the rewriting (translation) process. Translation, then, can be handled as a writing practice that makes use of the appropriate translation techniques and procedures, observing contextual differences. Translators write in almost every field, from simple to highly specialized texts. In translation, translators rewrite the Source Language Text in a Target Language that projects their competence in that TL, provided that they must thoroughly understand the respective ST; maintaining some sort of relevance or similarity between their reproduced TT, and its corresponding ST. This paper emphasizes the usefulness of translation practice in enhancing writing competence in various writing settings.

APA, Harvard, Vancouver, ISO, and other styles

29

Dunn, Dana S. "Lessons Learned from an Interdisciplinary Writing Course: Implications for Student Writing in Psychology." Teaching of Psychology 21, no. 4 (December 1994): 223–27. http://dx.doi.org/10.1207/s15328023top2104_4.

Full text

Abstract:

I discuss writing techniques and assessment methods and their use in Communication, the interdisciplinary writing course I teach. The writing techniques are freewriting, small-group work, and peer tutoring. The assessment methods include commentary on written assignments by more than one faculty evaluator, peer feedback, and optional versus mandatory rewriting. I then recommend applications for these writing techniques and assessment methods in psychology courses.

APA, Harvard, Vancouver, ISO, and other styles

30

Despeyroux, Joëlle, and Robert Harper. "Special issue on Logical Frameworks and Metalanguages http//www-sop.inria.fr/certilab/LFM00/cfp-jfp.html." Journal of Functional Programming 10, no. 1 (January 2000): 135–36. http://dx.doi.org/10.1017/s0956796899009892.

Full text

Abstract:

Logical frameworks and meta-languages are intended as a common substrate for representing and implementing a wide variety of logics and formal systems. Their definition and implementation have been the focus of considerable work over the last decade. At the heart of this work is a quest for generality: A logical framework provides a basis for capturing uniformities across deductive systems and support for implementing particular systems. Similarly a meta-language supports reasoning about and using languages.Logical frameworks have been based on a variety of different languages including higher-order logics, type theories with dependent types, linear logic, and modal logic. Techniques of representation of logics include higher-order abstract syntax, inductive definitions or some form of equational or rewriting logic in which substitution is explicitly encoded.Examples of systems that implement logical frameworks include Alf, Coq, NuPrl, HOL, Isabelle, Maude, lambda-Prolog and Twelf. An active area of research in such systems is the study of automated reasoning techniques. Current work includes the development of various automated procedures as well as the investigation of rewriting tools that use reflection or make use of links with systems that already have sophisticated rewriting systems. Program extraction and optimization are additional topics of ongoing work.

APA, Harvard, Vancouver, ISO, and other styles

31

Kœhler, Thomas, Andrés Goens, Siddharth Bhat, Tobias Grosser, Phil Trinder, and Michel Steuwer. "Guided Equality Saturation." Proceedings of the ACM on Programming Languages 8, POPL (January 5, 2024): 1727–58. http://dx.doi.org/10.1145/3632900.

Full text

Abstract:

Rewriting is a principled term transformation technique with uses across theorem proving and compilation. In theorem proving, each rewrite is a proof step; in compilation, rewrites optimize a program term. While developing rewrite sequences manually is possible, this process does not scale to larger rewrite sequences. Automated rewriting techniques, like greedy simplification or equality saturation, work well without requiring human input. Yet, they do not scale to large search spaces, limiting the complexity of tasks where automated rewriting is effective, and meaning that just a small increase in term size or rewrite length may result in failure. This paper proposes a semi-automatic rewriting technique as a means to scale rewriting by allowing human insight at key decision points. Specifically, we propose guided equality saturation that embraces human guidance when fully automated equality saturation does not scale. The rewriting is split into two simpler automatic equality saturation steps: from the original term to a human-provided intermediate guide , and from the guide to the target. Complex rewriting tasks may require multiple guides, resulting in a sequence of equality saturation steps. A guide can be a complete term, or a sketch containing undefined elements that are instantiated by the equality saturation search. Such sketches may be far more concise than complete terms. We demonstrate the generality and effectiveness of guided equality saturation using two case studies. First, we integrate guided equality saturation in the Lean 4 proof assistant. Proofs are written in the style of textbook proof sketches, as a series of calculations omitting details and skipping steps. These proofs conclude in less than a second instead of minutes when compared to unguided equality saturation, and can find complex proofs that previously had to be done manually. Second, in the compiler of the Rise array language, where unguided equality saturation fails to perform optimizations within an hour and using 60 GB of memory, guided equality saturation performs the same optimizations with at most 3 guides, within seconds using less than 1 GB memory.

APA, Harvard, Vancouver, ISO, and other styles

32

Despland, Annie, Monique Mazaud, and Raymond Rakotozafy. "Using rewriting techniques to produce code generators and proving them correct." Science of Computer Programming 15, no. 1 (November 1990): 15–54. http://dx.doi.org/10.1016/0167-6423(90)90043-d.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

BOMANSON, JORI, and TOMI JANHUNEN. "Boosting Answer Set Optimization with Weighted Comparator Networks." Theory and Practice of Logic Programming 20, no. 4 (May 11, 2020): 512–51. http://dx.doi.org/10.1017/s147106842000006x.

Full text

Abstract:

AbstractAnswer set programming (ASP) is a paradigm for modeling knowledge-intensive domains and solving challenging reasoning problems. In ASP solving, a typical strategy is to preprocess problem instances by rewriting complex rules into simpler ones. Normalization is a rewriting process that removes extended rule types altogether in favor of normal rules. Recently, such techniques led to optimization rewriting in ASP, where the goal is to boost answer set optimization by refactoring the optimization criteria of interest. In this paper, we present a novel, general, and effective technique for optimization rewriting based on comparator networks which are specific kinds of circuits for reordering the elements of vectors. The idea is to connect an ASP encoding of a comparator network to the literals being optimized and to redistribute the weights of these literals over the structure of the network. The encoding captures information about the weight of an answer set in auxiliary atoms in a structured way that is proven to yield exponential improvements during branch-and-bound optimization on an infinite family of example programs. The used comparator network can be tuned freely, for example, to find the best size for a given benchmark class. Experiments show accelerated optimization performance on several benchmark problems.

APA, Harvard, Vancouver, ISO, and other styles

34

Lukhovitskiy, Lev Vsevolodovich. "Early Palaiologan Hagiography: “Old” and “New” Saints under the Shadow of Symeon Metaphrastes." Античная древность и средние века 50 (2022): 283–311. http://dx.doi.org/10.15826/adsv.2022.50.017.

Full text

Abstract:

This article focuses on the hagiographical rewriting from the Palaiologan Period. Having outlined the corpus of relevant texts, the author discusses the two paradigms that currently permeate the scholarship dealing with the Late Byzantine hagiography, the “old saints” paradigm and the “metaphrasis” paradigm. Both approaches, despite their indisputable heuristic value, do not take into consideration all aspects of hagiographical rewriting in the period in question. The first paradigm is not adequate because, first, it is virtually impossible to determine how great the chronological distance between the hero and the text must be to make him or her “old”, and, second, because the life of old saint does not amount to a rewriting; vice versa, a rewritten text does not necessarily mean that we are dealing with the life of old saint. Regarding the second approach, the term “metaphrasis” inevitably creates an association with the metaphrastic Menologion, which is not entirely justifiable because the early Palaiologan hagiographic corpus differs from it minimum in four important ways: these texts are often transmitted in authorial collections (instead of menologia); they were composed on occasion (instead of being part of a prearranged program); they have individual (instead of collective) authorship; the rewriting techniques allow for major alterations in the contents and are rarely limited to passage-for-passage transposition.

APA, Harvard, Vancouver, ISO, and other styles

35

Dewi, Indah Rosalina, Akbar Al Masjid Masjid, Biya Ebi Praheto, and Trisharsiwi Trisharsiwi. "Flipbook Sebagai Media untuk Meningkatkan Keterampilan Menulis Kembali Teks Non-fiksi pada Peserta Didik Kelas 5 Sekolah Dasar." Indonesian Journal of Learning and Educational Studies 1, no. 2 (December 3, 2023): 78–86. http://dx.doi.org/10.62385/ijles.v1i2.59.

Full text

Abstract:

Writing is the most complex language skill, because writing skills involve proficiency in language selection, pouring logical and structured ideas. Writing skills in grade 5A students of SD Negeri Jomblangan are still relatively low. The purpose of this study is to improve the skills of rewriting nonfiction texts using flipbook media. This research uses Classroom Action Research, which consists of two cycles and consists of four main steps, namely planning, implementation, observation and reflection. Data collection techniques in this research include interviews, observation, tests, and documentation. Data analysis used quantitative and qualitative descriptive. The research results showed that, as seen in each research cycle, the skills of class 5 A students in rewriting nonfiction texts were improved by using flipbook media. The average score of students in cycle I rewriting nonfiction texts was 68.03 with a classical completeness level of 53.57%. In cycle II there was an increase in value, namely 79.82 with a classical completion level of 82.14%. For activities in cycle I, students obtained a score of 67.19% and in cycle II it increased to 90.63%. The conclusion of this research is that students in class 5 A of Jomblangan State Elementary School can effectively improve their skills in rewriting nonfiction texts using flipbook media.

APA, Harvard, Vancouver, ISO, and other styles

36

Guisado-Gámez, Joan, David Tamayo-Domènech, Jordi Urmeneta, and Josep Lluís Larriba-Pey. "ENRICH: A Query Rewriting Service Powered by Wikipedia Graph Structure." Proceedings of the International AAAI Conference on Web and Social Media 10, no. 2 (August 4, 2021): 47–50. http://dx.doi.org/10.1609/icwsm.v10i2.14829.

Full text

Abstract:

The search for relevant information in websites can be very frustrating for users who, unintentionally, use too general or inappropriate keywords to express their requests. To overcome this situation, query rewriting techniques aim at transforming the users requests to better describe the real intent of the users. However, to the best of our knowledge, current search tools either are too generic or require resources not available for everyone such as query log processors, natural language engines, etc. To supply this need, we present ENRICH, which is a query rewriting cloud service that is automatically tailored to each website and it is powered by an available, accessible and open resource: Wikipedia.

APA, Harvard, Vancouver, ISO, and other styles

37

HAMILTON, CYNTHIA S. "Strange Birds: Rewriting The Maltese Falcon." Journal of American Studies 47, no. 3 (January 16, 2013): 699–718. http://dx.doi.org/10.1017/s0021875812001752.

Full text

Abstract:

Hammett's formative role in establishing the conventions of the hard-boiled detective formula is widely acknowledged, but the formative influence of his masterpiece, The Maltese Falcon, on specific texts by subsequent innovators has remained largely unexplored territory. Both Sara Paretsky and Chester Himes have paid tribute to Hammett's influence, with particular reference to The Maltese Falcon. An examination of Indemnity Only and For the Love of Imabelle in relation to The Maltese Falcon offers a unique perspective on Paretsky's and Himes's stylistic choices and the social perspectives these articulated. It also helps to explain the critical reception of their work. Paretsky, writing within the grain of a type of social realism associated with both protest literature and hard-boiled detective fiction, achieved early recognition. Himes, writing against the grain, did not. Those of his detective novels most closely allied to his protest writing have received the most critical attention, but in For the Love of Imabelle, Himes used techniques allied to surrealism. These effectively disrupted and destabilized important, socially privileged discourses – and discomforted audiences and wrong-footed critics.

APA, Harvard, Vancouver, ISO, and other styles

38

GESER, ALFONS, and SERGEI GORLATCH. "Parallelizing functional programs by generalization." Journal of Functional Programming 9, no. 6 (November 1999): 649–73. http://dx.doi.org/10.1017/s0956796899003536.

Full text

Abstract:

List homomorphisms are functions that are parallelizable using the divide-and-conquer paradigm. We study the problem of finding homomorphic representations of functions in the Bird–Meertens constructive theory of lists, by means of term rewriting and theorem proving techniques. A previous work proved that to each pair of leftward and rightward sequential representations of a function, based on cons- and snoc-lists, respectively, there is also a representation as a homomorphism. Our contribution is a mechanizable method to extract the homomorphism representation from a pair of sequential representations. The method is decomposed to a generalization problem and an inductive claim, both solvable by term rewriting techniques. To solve the former we present a sound generalization procedure which yields the required representation, and terminates under reasonable assumptions. The inductive claim is provable automatically. We illustrate the method and the procedure by the systematic parallelization of the scan-function (parallel prefix) and of the maximum segment sum problem.

APA, Harvard, Vancouver, ISO, and other styles

39

Calabretta, Nicola, Hyun-Do Jung, Javier Herrera Llorente, Eduward Tangdiongga, Ton Koonen, and Harm Dorren. "All-Optical Techniques Enabling Packet Switching with Label Processing and Label Rewriting." Journal of Telecommunications and Information Technology, no. 1 (June 26, 2023): 20–28. http://dx.doi.org/10.26636/jtit.2009.1.909.

Full text

Abstract:

Scalability of packet switched cross-connects that utilize all-optical signal processing is a crucial issue that eventually determines the future role of photonic signal processing in optical networks. After reviewing several labeling techniques, we discuss label stacking and label swapping techniques and their benefits for scalable optical packet switched nodes. All-optical devices for implementing the packet switch based on the labeling techniques will be described. Finally, we present a 1×4 all-optical packet switch based on label swapping technique that utilizes a scalable and asynchronous label processor and label rewriter. Error-free operation indicates a potential utilization of the swapping technique in a multihop packet-switched network.

APA, Harvard, Vancouver, ISO, and other styles

40

Fuad, A. Jauhar. "Storytelling Variations and Student Writing Ability in Madrasah Ibtidaiyah." MODELING: Jurnal Program Studi PGMI 6, no. 1 (March 13, 2019): 13–30. http://dx.doi.org/10.36835/modeling.v6i1.347.

Full text

Abstract:

This paper is to find out learning that uses fairy tale methods and increase students' literacy skills in rewriting the contents of fairy tales. Researchers use classroom action research. Data collection techniques with observation and writing ability tests, with skinative and quantitative analysis techniques. Research findings: there is an increase in the ability to rewrite fairy tales read from cycle I to cycle II. There are variations in storytelling techniques by utilizing various learning media in the form of images, audio visuals and the surrounding environment.

APA, Harvard, Vancouver, ISO, and other styles

41

KUSAKARI, Keiichirou, and Masahiko SAKAI. "Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques." IEICE Transactions on Information and Systems E92-D, no. 2 (2009): 235–47. http://dx.doi.org/10.1587/transinf.e92.d.235.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Breitner, Joachim. "Proceedings Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation." Electronic Proceedings in Theoretical Computer Science 265 (February 16, 2018): 1. http://dx.doi.org/10.4204/eptcs.265.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Nasridinov, Aziz, Jeong-Yong Byun, and Young-Ho Park. "A Study on Detection Techniques of XML Rewriting Attacks in Web Services." International Journal of Control and Automation 7, no. 1 (January 31, 2014): 391–400. http://dx.doi.org/10.14257/ijca.2014.7.1.35.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Martos, Josep Lluís. "La reescritura del maldit de Joan Roís de Corella." Zeitschrift für romanische Philologie 135, no. 3 (September 12, 2019): 794–817. http://dx.doi.org/10.1515/zrp-2019-0043.

Full text

Abstract:

Abstract The Maldit is Joan Roís de Corella’s only poem that appears in all of the manuscript witnesses of his poetry, which is a good indication of its literary success. This article reviews the variations of the poem throughout these manuscripts in order to focus on the process of rewriting, which reaches its maximum development in the version transmitted in the cancionero known as the Jardinet d’orats. The variants of all of the witnesses are discussed from ecdotic perspectives and the focus is on the double version of the tornada. The article demonstrates that the maldit is Joan Roís de Corella’s poem in which there is the greatest development and the greatest adherence to troubadouresque techniques. The person responsible for the version in the Jardinet d’orats does not notice these formal characteristics, which disappear in the process of rewriting, and this is the principal argument for considering it apocryphal. The literary character of the poem, like the Valencian environment in which it was produced, respond to a certain collectivity, which a different poet took advantage to generate the rewriting of Joan Roís de Corella’s maldit.

APA, Harvard, Vancouver, ISO, and other styles

45

Renkema, Jan. "Mercurius en de Muzen." Toegepaste Taalwetenschap in Artikelen 28 (January 1, 1987): 18–33. http://dx.doi.org/10.1075/ttwia.28.03ren.

Full text

Abstract:

In this article some comments are made on research into business communication as a new vogue in applied linguistics (instead of as enrichment in text linguistics). Critical remarks are also made, in terms of cost-benefit analysis, about the difficulties that liberal arts students have in finding a job within a business setting. The main part of this article is devoted to the writing and rewriting of instruction texts, with an example of the instruction for use of a steam iron. The rewriting techniques for clarifying this text are reduced to the suitability principle and maxims like the maxim of motivation and the maxim of disambiguity. Within this theoretical framework the (re)writing of business texts can be more than an activity for the Muses and will be of benefit to Mercury in enhancing the effectivity of instruction manuals and other texts.

APA, Harvard, Vancouver, ISO, and other styles

46

Kotsireas, Ilias, Temur Kutsia, and Dimitris E. Simos. "Constructing orthogonal designs in powers of two via symbolic computation and rewriting techniques." Annals of Mathematics and Artificial Intelligence 88, no. 1-3 (November 29, 2018): 213–36. http://dx.doi.org/10.1007/s10472-018-9607-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Martínez Saucedo, Jesús. "A Eulogy for My Father." Departures in Critical Qualitative Research 10, no. 3 (2021): 10–18. http://dx.doi.org/10.1525/dcqr.2021.10.3.10.

Full text

Abstract:

“A Eulogy for My Father” is a long citational poem that integrates various writing techniques, such as writing and rewriting, autoethnography, prose, vignette, and citation. Following Mexican poet Sara Uribe, this poem acts as a “sounding board” that allows for the exploration of pain, disenfranchised grief, and trauma. Ultimately, the poem seeks to engage in a critical dialogue that questions the meaning of a “good death.”

APA, Harvard, Vancouver, ISO, and other styles

48

SAMOKHIN, IVAN S., and NATALYA M. NEPOMNYASHCHIKH. "“LIVE” AND “DEAD” PARAPHRASING: A RESEARCH BASED ON THE SERVICES PROVIDED BY MODERN ONLINE PROGRAMMES." Theoretical and Applied Linguistics, no. 3 (2021): 161–74. http://dx.doi.org/10.22250/2410-7190_2021_7_3_161_174.

Full text

Abstract:

The article explores the essence and basic techniques of paraphrasing (rewriting) of a Russian-language scientific text. The motivation for the study were modern requirements for the publication activity of teaching and research staff of Russian universities. The attempts of assessing the level of services provided by “synonymizers” - online paraphrasing tools - for Russian scientific text samples have not been discussed in linguistic literature. The synonymizers available on the Internet were given a task to process the introductory paragraph from the article “Literary Pedagogy: Formation and Prospects” by E. M. Shastina and colleagues. It was found that the main method of paraphrasing that modern online services apply is the use of synonyms, along with such methods as selecting hyponyms and hypernyms, descriptive rewriting, changing the syntactic structure and adding lexical units that do not affect the content of the utterance. We conclude that at the present, synonymizers cannot compete with people - the quality of paraphrasing performed by all tested online services turned out unsatisfactory compared to the human-made version that involves the same techniques but with a completely different result. Besides, the article presents “The list of popular words and phrases used in scientific texts (with identical and similar vocabulary)” developed by the authors.

APA, Harvard, Vancouver, ISO, and other styles

49

Muchlis, Madian Muhammad, Taufik Hidayat, and Ili Yanti. "Higher Order Thinking Skill (HOTS) Analysis of Students of the Institute of Islamic and Arabic Sciences (LIPIA) on Rewriting Ta'bir Books in Book Creator." Lisanudhad: Jurnal Bahasa, Pembelajaran, dan Sastra Arab 10, no. 01 (August 24, 2023): 157–75. http://dx.doi.org/10.21111/lisanudhad.v10i01.9719.

Full text

Abstract:

Higher Order Thinking Skill (HOTS ا) is a higher order thinking skill that is not only able to remember, understand and explain, but is able to analyze, evaluate and create a problem. HOTS can not only be seen from the work of the questions, but can also be seen from the side of creative ability in Arabic material. Rewriting the book "Ta'bir" in the بوك كريتور is one of the abilities to think creatively. The method used in this research is descriptive qualitative method. The data source is taken from students majoring in Idad Lughawi, Language Preparation in the form of project results in book كريتور. The subjects taken were group 2 with the topic "Birrul Walidain". There are three data analysis techniques, namely data reduction, data presentation and conclusion drawing. The result of the research is that it is known that there are innovations made by students in rewriting the book "Ta'bir" as seen from writing vocabulary explanations, adding pictures, adding exercises and adding audio.

APA, Harvard, Vancouver, ISO, and other styles

50

Ozolins, Uldis. "Rewriting the AUSIT Code of Ethics – principles, practice, dispute." Babel. Revue internationale de la traduction / International Journal of Translation 60, no. 3 (December 31, 2014): 347–70. http://dx.doi.org/10.1075/babel.60.3.05ozu.

Full text

Abstract:

Codes of ethics in translating and interpreting have become increasingly examined in recent literature, as practitioners in ever-widening fields of practice see such codes as essential in underpinning their professionalism. While such codes in various professions set standards for their association’s membership, codes in some sectors of translating and interpreting often have a wider function, detailing ground rules and techniques for practice and serving as educational documents, for users of services as much as for practitioners. The code of ethics developed by the Australian Institute of Interpreters and Translators [AUSIT] has been often cited in international literature as a broad, comprehensive generic code for professional practice. When this code was recently rewritten by its association, the wider functions of the code, as well as core considerations of practitioners’ role, conduct and autonomy were extensively debated. This article examines the issues that arose in rewriting the AUSIT code, drawing on international comparisons of how other codes have defined their central tenets.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Rewriting techniques'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles