Relevant bibliographies by topics / Rewriting techniques

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Rewriting techniques'

Author: Grafiati
Published: 25 May 2024
Last updated: 31 July 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Rewriting techniques.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Rewriting techniques"

1

GIESL, JÜRGEN, and AART MIDDELDORP. "Transformation techniques for context-sensitive rewrite systems." Journal of Functional Programming 14, no. 4 (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 t
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
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 (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 (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 (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 curr
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 plann
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 (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 (2015): 621–35. http://dx.doi.org/10.1109/tkde.2014.2339816.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Rewriting techniques"

1

Sapiña, Sanchis Julia. "Rewriting Logic Techniques for Program Analysis and Optimization." Doctoral thesis, Universitat Politècnica de València, 2018. http://hdl.handle.net/10251/94044.

Full text
Abstract:
Esta tesis propone una metodología de análisis dinámico que mejora el diagnóstico de programas erróneos escritos en el lenguaje Maude. La idea clave es combinar técnicas de verificación de aserciones en tiempo de ejecución con la fragmentación dinámica de trazas de ejecución para detectar automáticamente errores en tiempo de ejecución, al tiempo que se reduce el tamaño y la complejidad de las trazas a analizar. En el caso de violarse una aserción, se infiere automáticamente el criterio de fragmentación, lo que facilita al usuario identificar rápidamente la fuente del error. En primer lugar, l
APA, Harvard, Vancouver, ISO, and other styles
2

Papadopoulos, George Angelos. "Parallel implementation of concurrent logic languages using graph rewriting techniques." Thesis, University of East Anglia, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.329340.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Buth, Karl-Heinz [Verfasser]. "Techniques for Modelling Structured Operational and Denotational Semantics Definitions with Term Rewriting Systems / Karl Heinz Buth." Kiel : Universitätsbibliothek Kiel, 1994. http://d-nb.info/1080332669/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Feliú, Gabaldón Marco Antonio. "Logic-based techniques for program analysis and specification synthesis." Doctoral thesis, Universitat Politècnica de València, 2013. http://hdl.handle.net/10251/33747.

Full text
Abstract:
La Tesis investiga técnicas ágiles dentro del paradigma declarativo para dar solución a dos problemas: el análisis de programas y la inferencia de especificaciones a partir de programas escritos en lenguajes multiparadigma y en lenguajes imperativos con tipos, objetos, estructuras y punteros. Respecto al estado actual de la tesis, la parte de análisis de programas ya está consolidada, mientras que la parte de inferencia de especificaciones sigue en fase de desarrollo activo. La primera parte da soluciones para la ejecución de análisis de punteros especificados en Datalog. En esta parte se han
APA, Harvard, Vancouver, ISO, and other styles
5

Rusinowitch, Michaël. "Démonstration automatique par des techniques de réécritures." Nancy 1, 1987. http://www.theses.fr/1987NAN10358.

Full text
Abstract:
Introduction à la logique du premier ordre et aux systèmes de réécriture. Étude de quelques ordres de simplification. Arbres sémantiques transfinis. Stratégies de paramodulation. Complétude en présence de règles de réduction. Stratégies de superposition. Ensembles complets de règles d'inférence pour les axiomes de régularité
APA, Harvard, Vancouver, ISO, and other styles
6

Kamat, Niranjan Ganesh. "Sampling-based Techniques for Interactive Exploration of Large Datasets." The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1523552932728325.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Karanasos, Konstantinos. "View-Based techniques for the efficient management of web data." Phd thesis, Université Paris Sud - Paris XI, 2012. http://tel.archives-ouvertes.fr/tel-00755328.

Full text
Abstract:
Data is being published in digital formats at very high rates nowadays. A large share of this data has complex structure, typically organized as trees (Web documents such as HTML and XML being the most representative) or graphs (in particular, graph-structured Semantic Web databases, expressed in RDF). There is great interest in exploiting such complex data, whether in an Open Data access model or within companies owning it, and efficiently doing so for large data volumes remains challenging. Materialized views have long been used to obtain significant performance improvements when processing
APA, Harvard, Vancouver, ISO, and other styles
8

Beveraggi, Marc. "Problemes combinatoires en codage algebrique." Paris 6, 1987. http://www.theses.fr/1987PA066265.

Full text
Abstract:
La these comporte quatre parties : la premiere traite des codes a longueur variable; on etablit des bornes inferieures et superieures pour la cardinalite des codes de ce type, correcteurs ou detecteurs d'une erreur, et parfois prefixes; la deuxieme etudie la cardinalite maximale d'un ensemble de permutations tel que deux permutations quelconques soient k-compatibles; la troisieme concerne le nombre maximal de reecritures de n nombres sur une memoire a ecriture irreversible de taille n; la quatrieme traite d'un probleme similaire au precedent avec la condition supplementaire que les nombres ecr
APA, Harvard, Vancouver, ISO, and other styles
9

Ferey, Gaspard. "Higher-Order Confluence and Universe Embedding in the Logical Framework." Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG032.

Full text
Abstract:
La multiplicité des systèmes formels a mis en évidence la nécessité d'un socle logique commun dans lequel les formalismes logiques pourraient être exprimés.L'enjeu principal de ce manuscrit est la définition de techniques d'encodages reposant sur la réécriture de termes et capables de réprésenter les fonctionnalités avancées des systèmes de types modernes.Nos encodages s'appuieront sur le lambda-Pi calcul modulo, un système de types dépendants, communément utilisé comme cadre logique, étendu ici par de laréécriture d'ordre supérieur. On s'intéresse, dans une première partie, aux critères de co
APA, Harvard, Vancouver, ISO, and other styles
10

Zighem, Ismail. "Etude d'invariants de graphes planaires." Université Joseph Fourier (Grenoble), 1998. http://www.theses.fr/1998GRE10211.

Full text
Abstract:
Dans la première partie, nous construisons, à partir de relations linéaires de récurrence, des invariants de graphes planaires 4-réguliers prenant leurs valeurs dans un anneau commutatif. Ces relations représentent des règles récursives bien définies sur cette catégories de graphes, ramenant le calcul des valeurs de l'invariant en ces graphes à une combinaison linéaire d'autres graphes plus réduits. Après avoir dégagé quelques conditions nécessaires pour que ces règles soient mutuellement compatibles, nous montrons en utilisant un résultat de la théorie des systèmes de réécriture qu'elles sont
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Rewriting techniques"

1

Bronstein, Manuel, Volker Weispfenning, and Johannes Grabmeier, eds. Symbolic Rewriting Techniques. Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bronstein, Manuel. Symbolic Rewriting Techniques. Birkhäuser Basel, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kirchner, Claude, ed. Rewriting Techniques and Applications. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-662-21551-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nieuwenhuis, Robert, ed. Rewriting Techniques and Applications. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44881-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Voronkov, Andrei, ed. Rewriting Techniques and Applications. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-70590-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Comon, Hubert, ed. Rewriting Techniques and Applications. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62950-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nipkow, Tobias, ed. Rewriting Techniques and Applications. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0052355.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jouannaud, Jean-Pierre, ed. Rewriting Techniques and Applications. Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15976-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lescanne, Pierre, ed. Rewriting Techniques and Applications. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-17220-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dershowitz, Nachum, ed. Rewriting Techniques and Applications. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51081-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Rewriting techniques"

1

Zhang, Hantao, and Jean-Luc Remy. "Contextual rewriting." In Rewriting Techniques and Applications. Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15976-2_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Granicz, Adam, Daniel M. Zimmerman, and Jason Hickey. "Rewriting UNITY." In Rewriting Techniques and Applications. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44881-0_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lucas, Salvador. "Transfinite Rewriting Semantics for Term Rewriting Systems." In Rewriting Techniques and Applications. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45127-7_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Amrhein, Beatrice, Reinhard Bündgen, and Wolfgang Küchlin. "Parallel Completion Techniques." In Symbolic Rewriting Techniques. Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Martin, Ursula. "New Directions for Syntactic Termination Orderings." In Symbolic Rewriting Techniques. Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pesch, Michael. "Two-sided Gröbner Bases in Iterated Ore Extensions." In Symbolic Rewriting Techniques. Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pethö, Attila, Joachim Stein, Thomas Weis, and Horst G. Zimmer. "Computing the Torsion Group of Elliptic Curves by the Method of Gröbner Bases." In Symbolic Rewriting Techniques. Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Strogova, Polina. "Finding a Finite Group Presentation Using Rewriting." In Symbolic Rewriting Techniques. Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Widiger, Alfred. "Deciding Degree-Four-Identities for Alternative Rings by Rewriting." In Symbolic Rewriting Techniques. Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Apel, Joachim. "The Computation of Gröbner Bases Using an Alternative Algorithm." In Symbolic Rewriting Techniques. Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Rewriting techniques"

1

Dodaro, Carmine, Giuseppe Mazzotta, and Francesco Ricca. "Blending Grounding and Compilation for Efficient ASP Solving." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/30.

Full text
Abstract:
Answer Set Programming (ASP) is a widely recognized formalism for Knowledge Representation and Reasoning. Traditional ASP systems, that employ the ground and solve architecture, are subject to the grounding bottleneck (i.e., variable-elimination can exhaust all computational resources). Compilation-based approaches have recently demonstrated how grounding can be effectively bypassed by compiling rules into propagators that simulate them. However, compiling an entire ASP program is not always advantageous. In this paper, we present both a program rewriting technique and an algorithm for the com
APA, Harvard, Vancouver, ISO, and other styles
2

Nagaraj, Vaivaswatha, and R. Govindarajan. "Parallel flow-sensitive pointer analysis by graph-rewriting." In 22nd International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 2013. http://dx.doi.org/10.1109/pact.2013.6618793.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rizvi, Shariq, Alberto Mendelzon, S. Sudarshan, and Prasan Roy. "Extending query rewriting techniques for fine-grained access control." In the 2004 ACM SIGMOD international conference. ACM Press, 2004. http://dx.doi.org/10.1145/1007568.1007631.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chandrasekhar, M. S., J. P. Privitera, and K. W. Conradt. "Application of term rewriting techniques to hardware design verification." In 24th ACM/IEEE conference proceedings. ACM Press, 1987. http://dx.doi.org/10.1145/37888.37930.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Christy, D. K. Sheena, P. John Paul, and D. G. Thomas. "H-array system on picture languages with array rewriting rules." In 1ST INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2020. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0025583.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sweety, F., K. Sasikala, T. Kalyani, and D. G. Thomas. "Partial array-rewriting P systems and basic puzzle partial array grammars." In 1ST INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2020. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0027078.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Olszewski, Marek, Jeremy Cutler, and J. Gregory Steffan. "JudoSTM: A Dynamic Binary-Rewriting Approach to Software Transactional Memory." In 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007). IEEE, 2007. http://dx.doi.org/10.1109/pact.2007.4336226.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Arias, Jaime, Kyungmin Bae, Carlos Olarte, Peter Csaba Ölveczky, Laure Petrucci, and Fredrik Rømming. "Rewriting Logic Semantics and Symbolic Analysis for Parametric Timed Automata." In FTSCS '22: 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems. ACM, 2022. http://dx.doi.org/10.1145/3563822.3569923.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Avenhaus, J., and D. Wi:Gbmann. "Using rewriting techniques to solve the generalized word problem in polycyclic groups." In the ACM-SIGSAM 1989 international symposium. ACM Press, 1989. http://dx.doi.org/10.1145/74540.74579.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lee, Jaeseo, Sangki Kim, and Kyungmin Bae. "Bounded Model Checking of PLC ST Programs using Rewriting Modulo SMT." In FTSCS '22: 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems. ACM, 2022. http://dx.doi.org/10.1145/3563822.3568016.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Rewriting techniques"

1

Borgwardt, Stefan, Marcel Lippmann, and Veronika Thost. Temporal Query Answering w.r.t. DL-Lite-Ontologies. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.195.

Full text
Abstract:
Ontology-based data access (OBDA) generalizes query answering in relational databases. It allows to query a database by using the language of an ontology, abstracting from the actual relations of the database. For ontologies formulated in Description Logics of the DL-Lite family, OBDA can be realized by rewriting the query into a classical first-order query, e.g. an SQL query, by compiling the information of the ontology into the query. The query is then answered using classical database techniques. In this report, we consider a temporal version of OBDA. We propose a temporal query language th
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Rewriting techniques' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography