Thematische Bibliographien / Rewriting techniques

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Rewriting techniques“

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Rewriting techniques" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Rewriting techniques"

GIESL, JÜRGEN, und AART MIDDELDORP. „Transformation techniques for context-sensitive rewrite systems“. Journal of Functional Programming 14, Nr. 4 (07.06.2004): 379–427. http://dx.doi.org/10.1017/s0956796803004945.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gazeau, Ivan, Dale Miller und Catuscia Palamidessi. „Non-local Robustness Analysis via Rewriting Techniques“. Electronic Proceedings in Theoretical Computer Science 103 (14.12.2012): 65. http://dx.doi.org/10.4204/eptcs.103.8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

Ambite, J. L., und C. A. Knoblock. „Planning by Rewriting“. Journal of Artificial Intelligence Research 15 (01.09.2001): 207–61. http://dx.doi.org/10.1613/jair.754.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Greco, Sergio, Francesca Spezzano und Irina Trubitsyna. „Checking Chase Termination: Cyclicity Analysis and Rewriting Techniques“. IEEE Transactions on Knowledge and Data Engineering 27, Nr. 3 (01.03.2015): 621–35. http://dx.doi.org/10.1109/tkde.2014.2339816.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Rewriting techniques"

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.

Der volle Inhalt der Quelle

Annotation:

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, la tesis formaliza una técnica destinada a detectar automáticamente eventuales desviaciones del comportamiento deseado del programa (síntomas de error). Esta técnica soporta dos tipos de aserciones definidas por el usuario: aserciones funcionales (que restringen llamadas a funciones deterministas) y aserciones de sistema (que especifican los invariantes de estado del sistema). La técnica de verificación dinámica propuesta es demostrablemente correcta en el sentido de que todos los errores señalados definitivamente delatan la violación de las aserciones. Tras eventuales violaciones de aserciones, se generan automáticamente trazas fragmentadas (es decir, trazas simplificadas pero igualmente precisas) que ayudan a identificar la causa del error. Además, la técnica también sugiere una posible reparación para las reglas implicadas en la generación de los estados erróneos. La metodología propuesta se basa en (i) una notación lógica para especificar las aserciones que se imponen a la ejecución; (ii) una técnica de verificación aplicable en tiempo de ejecución que comprueba dinámicamente las aserciones; y (iii) un mecanismo basado en la generalización (ecuacional) menos general que automáticamente obtiene criterios precisos para fragmentar trazas de ejecución a partir de aserciones falsificadas. Por último, se presenta una implementación de la técnica propuesta en la herramienta de análisis dinámico basado en aserciones ABETS, que muestra cómo es posible combinar el trazado de las propiedades asertadas del programa para obtener un algoritmo preciso de análisis de trazas que resulta útil para el diagnóstico y la depuración de programas.
This thesis proposes a dynamic analysis methodology for improving the diagnosis of erroneous Maude programs. The key idea is to combine runtime assertion checking and dynamic trace slicing for automatically catching errors at runtime while reducing the size and complexity of the erroneous traces to be analyzed (i.e., those leading to states that fail to satisfy the assertions). In the event of an assertion violation, the slicing criterion is automatically inferred, which facilitates the user to rapidly pinpoint the source of the error. First, a technique is formalized that aims at automatically detecting anomalous deviations of the intended program behavior (error symptoms) by using assertions that are checked at runtime. This technique supports two types of user-defined assertions: functional assertions (which constrain deterministic function calls) and system assertions (which specify system state invariants). The proposed dynamic checking is provably sound in the sense that all errors flagged definitely signal a violation of the specifications. Then, upon eventual assertion violations, accurate trace slices (i.e., simplified yet precise execution traces) are generated automatically, which help identify the cause of the error. Moreover, the technique also suggests a possible repair for the rules involved in the generation of the erroneous states. The proposed methodology is based on (i) a logical notation for specifying assertions that are imposed on execution runs; (ii) a runtime checking technique that dynamically tests the assertions; and (iii) a mechanism based on (equational) least general generalization that automatically derives accurate criteria for slicing from falsified assertions. Finally, an implementation of the proposed technique is presented in the assertion-based, dynamic analyzer ABETS, which shows how the forward and backward tracking of asserted program properties leads to a thorough trace analysis algorithm that can be used for program diagnosis and debugging.
Esta tesi proposa una metodologia d'anàlisi dinàmica que millora el diagnòstic de programes erronis escrits en el llenguatge Maude. La idea clau és combinar tècniques de verificació d'assercions en temps d'execució amb la fragmentació dinàmica de traces d'execució per a detectar automàticament errors en temps d'execució, alhora que es reduïx la grandària i la complexitat de les traces a analitzar. En el cas de violar-se una asserció, s'inferix automàticament el criteri de fragmentació, la qual cosa facilita a l'usuari identificar ràpidament la font de l'error. En primer lloc, la tesi formalitza una tècnica destinada a detectar automàticament eventuals desviacions del comportament desitjat del programa (símptomes d'error). Esta tècnica suporta dos tipus d'assercions definides per l'usuari: assercions funcionals (que restringixen crides a funcions deterministes) i assercions de sistema (que especifiquen els invariants d'estat del sistema). La tècnica de verificació dinàmica proposta és demostrablement correcta en el sentit que tots els errors assenyalats definitivament delaten la violació de les assercions. Davant eventuals violacions d'assercions, es generen automàticament traces fragmentades (és a dir, traces simplificades però igualment precises) que ajuden a identificar la causa de l'error. A més, la tècnica també suggerix una possible reparació de les regles implicades en la generació dels estats erronis. La metodologia proposada es basa en (i) una notació lògica per a especificar les assercions que s'imposen a l'execució; (ii) una tècnica de verificació aplicable en temps d'execució que comprova dinàmicament les assercions; i (iii) un mecanisme basat en la generalització (ecuacional) menys general que automàticament obté criteris precisos per a fragmentar traces d'execució a partir d'assercions falsificades. Finalment, es presenta una implementació de la tècnica proposta en la ferramenta d'anàlisi dinàmica basat en assercions ABETS, que mostra com és possible combinar el traçat cap avant i cap arrere de les propietats assertades del programa per a obtindre un algoritme precís d'anàlisi de traces que resulta útil per al diagnòstic i la depuració de programes.
Sapiña Sanchis, J. (2017). Rewriting Logic Techniques for Program Analysis and Optimization [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/94044
TESIS

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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 desarrollado dos técnicas de ejecución de especificaciones en dicho lenguaje Datalog: una de ellas utiliza resolutores de sistemas de ecuaciones booleanas, y la otra utiliza la lógica de reescritura implementada eficientemente en el lenguaje Maude. La segunda parte desarrolla técnicas de inferencia de especificaciones a partir de programas. En esta parte se han desarrollado dos métodos de inferencia de especificaciones. El primer método se desarrolló para el lenguaje lógico-funcional Curry y permite inferir especificaciones ecuacionales mediante interpretación abstracta de los programas. El segundo método está siendo desarrollado para lenguajes imperativos realistas, y se ha aplicado a un subconjunto del lenguaje de programación C. Este método permite inferir especificaciones en forma de reglas que representan las distintas relaciones entre las propiedades que el estado de un programa satisface antes y después de su ejecución. Además, estas propiedades son expresables en términos de las abstracciones funcionales del propio programa, resultando en una especificación de muy alto nivel y, por lo tanto, de más fácil comprensión.
Feliú Gabaldón, MA. (2013). Logic-based techniques for program analysis and specification synthesis [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/33747
TESIS

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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 queries. The principle is that a view stores pre-computed results that can be used to evaluate (possibly part of) a query. Adapting materialized view techniques to the Web data setting we consider is particularly challenging due to the structural and semantic complexity of the data. This thesis tackles two problems in the broad context of materialized view-based management of Web data. First, we focus on the problem of view selection for RDF query workloads. We present a novel algorithm, which, based on a query workload, proposes the most appropriate views to be materialized in the database, in order to minimize the combined cost of query evaluation, view maintenance and view storage. Although RDF query workloads typically feature many joins, hampering the view selection process, our algorithm scales to hundreds of queries, a number unattained by existing approaches. Furthermore, we propose new techniques to account for the implicit data that can be derived by the RDF Schemas and which further complicate the view selection process. The second contribution of our work concerns query rewriting based on materialized XML views. We start by identifying an expressive dialect of XQuery, corresponding to tree patterns with value joins, and study some important properties for these queries, such as containment and minimization. Based on these notions, we consider the problem of finding minimal equivalent rewritings of a query expressed in this dialect, using materialized views expressed in the same dialect, and provide a sound and complete algorithm for that purpose. Our work extends the state of the art by allowing each pattern node to return a set of attributes, supporting value joins in the patterns, and considering rewritings which combine many views. Finally, we show how our view-based query rewriting algorithm can be applied in a distributed setting, in order to efficiently disseminate corpora of XML documents carrying RDF annotations.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 ecrits sur la memoire sont en ordre croissant

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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 confluence de systèmes de réécriture avec la bêta réduction.La confluence d'un système linéaire à gauche se déduit de l'étude de ses paires critiques pour lesquelles il faut exhiber un diagramme décroissant vis-à-vis d'un certain étiquetage des règles.Le cas non-linéaire nécessite, lui, une compartimentalisation des termes considérés.On considère, dans un second temps, l'encodage de systèmes de types complexes.Sont étudiés successivement, la cumulativité qui nécessite de considérer des symboles privés pour encoder une forme de ``proof irrelevance'', les expressions algébriques d'univers sous contraintes d'univers et enfin le polymorphisme d'univers dont on prouve la correction d'une fonction de traduction depuis un sous-ensemble de Coq.L'implantation de ces résultats a permis de traduire en Dedukti plusieurs développements Coq de taille significative
In the context of the multiplicity of formal systems, it has become a growing need to express formal proofs into a common logical framework.This thesis focuses on the use of higher-order term rewriting to embed complex formal systems in the simple and well-studied lambda-Pi calculus modulo.This system, commonly used as a logical framework, features dependent types and is extended with higher-order term rewriting.We study, in a first part, criterias for the confluence properties of higher-order rewrite systems considered together with the usual beta reduction.In the case of left-linear systems, confluence can be reduced to the study of critical pairs which must be provided a decreasing diagram with relation to some rule labeling.We show that in the presence of non-linear rules, it is still possible to achieve confluence if the set of considered terms is layered.We then focus, in a second part, on the encoding of higher-order logics based on complex universe structures. The embeding of cumulativity, a limited form of subtyping, is handled with new rewriting techniques relying on private symbols and allowing some form of proof irrelevance.We then describe how algebraic universe expressions containing level variables can be represented, even in presence of universe constraints.Eventually we introduce an embeding of universe polymorphism as defined in the core logic of the Coq system and prove the correctness of the defined translation mechanism.These results, along with other more practical techniques, allowed the implementation of a translator to Dedukti which was used to translate several sizeable Coq developments

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 aussi suffisantes. Nous terminons cette partie en évoquant la relation avec le polynôme de Kauffman et en montrant que, pour une évaluation particulière de ses variables, ce polynôme peut être défini à partir de notre invariant. Ce qui constitue une nouvelle preuve d'existence de ce polynôme. La seconde partie aborde le problème de la détermination du nombre d'absorption des graphes de type grille. Dans un premier temps, nous déterminons ce nombre pour les petites grilles croisées (graphes produit croisé de deux chaînes de longueurs k et n, avec k ≤ 33 et n ≤ 40). En utilisant la programmation dynamique, nous présentons pour k fixé un algorithme linéaire en n pour calculer ce nombre. On en déduit alors que ce nombre vérifie des formules simples en fonction de k et n. Ensuite, nous montrons par récurrence, en prenant ces valeurs comme base de récurrence, que ces formules sont vérifiées par ce nombre, pour tous k = 12 ou k ≥ 14 et n ≥ k. Finalement, nous donnons quelques bornes du nombre d'absorption de la grille carrée (graphe produit carré de deux chaînes) qui améliorent les résultats déjà connus

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Rewriting techniques"

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Rewriting techniques"

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Rewriting techniques"

Nagaraj, Vaivaswatha, und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Christy, D. K. Sheena, P. John Paul und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sweety, F., K. Sasikala, T. Kalyani und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Olszewski, Marek, Jeremy Cutler und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Arias, Jaime, Kyungmin Bae, Carlos Olarte, Peter Csaba Ölveczky, Laure Petrucci und 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. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3563822.3569923.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lee, Jaeseo, Sangki Kim und 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. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3563822.3568016.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gheerbrant, Amélie, und Cristina Sirangelo. „Best Answers over Incomplete Data : Complexity and First-Order Rewritings“. In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/236.

Der volle Inhalt der Quelle

Annotation:

Answering queries over incomplete data is ubiquitous in data management and in many AI applications that use query rewriting to take advantage of relational database technology. In these scenarios one lacks full information on the data but queries still need to be answered with certainty. The certainty aspect often makes query answering unfeasible except for restricted classes, such as unions of conjunctive queries. In addition often there are no, or very few certain answers, thus expensive computation is in vain. Therefore we study a relaxation of certain answers called best answers. They are defined as those answers for which there is no better one (that is, no answer true in more possible worlds). When certain answers exist the two notions coincide. We compare different ways of casting query answering as a decision problem and characterise its complexity for first-order queries, showing significant differences in the behavior of best and certain answers.We then restrict attention to best answers for unions of conjunctive queries and produce a practical algorithm for finding them based on query rewriting techniques.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Rewriting techniques"

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

Der volle Inhalt der Quelle

Annotation:

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 that combines a linear temporal logic with queries over DL-Litecore-ontologies. This language is well-suited for expressing temporal properties of dynamical systems and is useful in context-aware applications that need to detect specific situations. Using a first-order rewriting approach, we transform our temporal queries into queries over a temporal database. We then present three approaches to answering the resulting queries, all having different advantages and drawbacks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!