Filters








5,030 Hits in 5.0 sec

Generalized Parsing and Term Rewriting: Semantics Driven Disambiguation

M.G.J. van den Brand, A.S. Klusener, L. Moonen, J.J. Vinju
2003 Electronical Notes in Theoretical Computer Science  
However, many programming languages have syntactical ambiguities that can only be solved using semantical analysis.  ...  In this paper we propose to apply the paradigm of term rewriting to filter ambiguities based on semantical information. We start with the definition of a representation of ambiguous derivations.  ...  There are several languages using some form of offside rule, among others, Haskell [12] .  ... 
doi:10.1016/s1571-0661(05)82629-5 fatcat:lkyl7l4pwvaibc6czuj2j5qeza

Learning metamorphic malware signatures from samples

Marco Campion, Mila Dalla Preda, Roberto Giacobazzi
2021 Journal in Computer Virology and Hacking Techniques  
The upper approximation process is based on the concept of widening automata, while the semantic preserving transformation rules, used by the metamorphic program, can be viewed as rewriting rules and modeled  ...  AbstractMetamorphic malware are self-modifying programs which apply semantic preserving transformations to their own code in order to foil detection systems based on signature matching.  ...  Finally, the algorithm proceeds by eliminating redundant rules. An inferred rewriting rule is called redundant, if it can be generated by other rules in the set of inferred rewriting rules.  ... 
doi:10.1007/s11416-021-00377-z fatcat:ua7rwcb4wfdcjh2ihhk22j3id4

Algebraic Graph Transformations for Merging Ontologies [chapter]

Mariem Mahfoudh, Laurent Thiry, Germain Forestier, Michel Hassenforder
2014 Lecture Notes in Computer Science  
Thus, this paper proposes a formal approach for merging ontologies using typed graph grammars.  ...  Further, a new ontologies merging algorithm called GROM (Graph Rewriting for Ontologies Merge) is presented.  ...  Thus, Levenshtein distance is used for detecting the common and equivalent terms and WordNet is used to recognize the semantic correspondences essentially the synonym terms.  ... 
doi:10.1007/978-3-319-11587-0_16 fatcat:jdllawn34bcbrc2p5vghdbfywa

A Benchmark for Ontologies Merging Assessment [chapter]

Mariem Mahfoudh, Germain Forestier, Michel Hassenforder
2016 Lecture Notes in Computer Science  
We also show how the GROM tool (Graph Rewriting for Ontology Merging) can address the merging process and we evaluate it based on coverage, redundancy and coherence metrics.  ...  We performed experiments and show that the tool obtained good results in terms of redundancy and coherence. This is the author's version of an article published at KSEM 2010.  ...  -P is a set of production rules also called graph rewriting rules which are defined by a pair of graphs patterns (LHS, RHS) where: 1) LHS (Left Hand Side) represents the preconditions of the rewriting  ... 
doi:10.1007/978-3-319-47650-6_44 fatcat:j2umrmks5nfmhitayu6hacan64

Schema polynomials and applications

Kenneth A. Ross, Julia Stoyanovich
2008 Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08  
We also propose the use of schema polynomials to model and derive alternative representations for complex relationships with constraints.  ...  We demonstrate how the schema factorization framework can be used to generate relational, object-oriented, and faceted physical schemas, allowing a wider exploration of physical schema alternatives than  ...  product terms. 2 Lemma 2.4.  ... 
doi:10.1145/1352431.1352482 fatcat:7eu4efs7mremnnkuswdzmze3qe

Schema polynomials and applications

Kenneth A. Ross, Julia Stoyanovich
2008 Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08  
We also propose the use of schema polynomials to model and derive alternative representations for complex relationships with constraints.  ...  We demonstrate how the schema factorization framework can be used to generate relational, object-oriented, and faceted physical schemas, allowing a wider exploration of physical schema alternatives than  ...  product terms. 2 Lemma 2.4.  ... 
doi:10.1145/1353343.1353394 dblp:conf/edbt/RossS08 fatcat:gearj7atb5etvltggzsqcgvtii

From Search to Computation: Redundancy Criteria and Simplification at Work [chapter]

Thomas Hillenbrand, Ruzica Piskac, Uwe Waldmann, Christoph Weidenbach
2013 Lecture Notes in Computer Science  
When executed by a theorem prover, the inference rules of these calculi usually generate a tremendously growing search space.  ...  This includes a variant of contextual rewriting to decide a subclass of Euclidean geometry, ordered chaining techniques for Church-Rosser and priority queue proofs, contextual rewriting and history-dependent  ...  Now with these two extra rules local contextual rewriting and semantic tautology deletion the Balbiani system can be finitely saturated.  ... 
doi:10.1007/978-3-642-37651-1_7 fatcat:fr4uqtwvubbtvgjepamaamojeu

Generic Encodings of Constructor Rewriting Systems [article]

Horatiu Cirstea, Pierre-Etienne Moreau
2019 arXiv   pre-print
into classical term rewriting systems.  ...  As a direct consequence, established methods used for term rewriting systems can be applied to analyze properties of the extended systems.  ...  We want to thank Paul Brauner who implemented the Haskell version of the algorithm and who gave us very helpful feedback on previous drafts of this paper.  ... 
arXiv:1905.06233v2 fatcat:het3nbsdkzhsxmoyi4xpxrqqnm

Generic Encodings of Constructor Rewriting Systems

Horatiu Cirstea, Pierre-Etienne Moreau
2019 Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019 - PPDP '19  
into classical term rewriting systems.  ...  As a direct consequence, established methods used for term rewriting systems can be applied to analyze properties of the extended systems.  ...  We want to thank Paul Brauner who implemented the Haskell version of the algorithm and who gave us very helpful feedback on previous drafts of this paper.  ... 
doi:10.1145/3354166.3354173 dblp:conf/ppdp/CirsteaM19 fatcat:zrc56e667jeenlifk7pxpbgfci

Automatic Workarounds

Antonio Carzaniga, Alessandra Gorla, Nicolò Perino, Mauro Pezzè
2015 ACM Transactions on Software Engineering and Methodology  
We observe that modern software systems naturally acquire another type of redundancy that is not introduced deliberately but rather arises intrinsically as a by-product of modern modular software design  ...  In particular, we implement this technique within a browser extension, which we then use in an evaluation with several known faults and failures of three popular Web libraries.  ...  to identify valid workarounds among the many redundant executions identified with rewriting rules.  ... 
doi:10.1145/2755970 fatcat:guzn5kflw5flrf5c7mbhrfaeye

Reflective control of attributed entities in feature-based CAD systems using a CARW system manager [chapter]

F. Mandorli, U. Cugini, H. E. Otto, F. Kimura
1996 IFIP Advances in Information and Communication Technology  
Of major interest are-within the given scope-consistency aspects among attributed entities of different domains and the use of reflective techniques to support status evaluation of design features, their  ...  Due to the rule-based approach, a high degree of flexibility and modularity can be achieved, while perpetuating the system's overall control in the form of a CARW manager.  ...  Within our framework, feature-based operations are described in terms of rewriting rules.  ... 
doi:10.1007/978-0-387-34930-5_11 fatcat:6whfzxxxebhl7ivlqwbqy5qddi

Control Localization in Domain Specific Translation [chapter]

Ted J. Biggerstaff
2002 Lecture Notes in Computer Science  
Human programmers recognize the relation among these distributed control structures and merge them to minimize the redundancy of control.  ...  This paper discusses strategies for automating localization without large search spaces and outlines a domain specific example of transformation rules for localizing control.  ...  Most of these will be redundant. Other rules will be added that merge away these redundancies by discarding redundant pixels and indexes.  ... 
doi:10.1007/3-540-46020-9_11 fatcat:mdfr26dwjvgqlfmd6fks4ctkxy

The Model Evolution Calculus with Equality [chapter]

Peter Baumgartner, Cesare Tinelli
2005 Lecture Notes in Computer Science  
For equational reasoning ME E uses an adapted version of the ordered paramodulation inference rule, where equations used for paramodulation are drawn (only) from the candidate model.  ...  The calculus also features a generic, semantically justified simplification rule which covers many simplification techniques known from superposition-style theorem proving.  ...  Among them is Ordered Semantic Hyperlinking (OSHL) [PZ00] .  ... 
doi:10.1007/11532231_29 fatcat:4zmryafkqzct5g3kskjhn2ja4y

A machine learning approach to textual entailment recognition

FABIO MASSIMO ZANZOTTO, MARCO PENNACCHIOTTI, ALESSANDRO MOSCHITTI
2009 Natural Language Engineering  
In this paper, we approach the problem by first introducing the class of pair feature spaces, which allow supervised machine learning algorithms to derive first-order rewrite rules from annotated examples  ...  In particular, we propose syntactic and shallow semantic feature spaces, and compare them to standard ones.  ...  Rewrite rules and rule-based systems Ground and first-order rewrite rules are largely used to encode knowledge in RTE systems, operating at different levels of interpretation: lexical, syntactic, or semantic  ... 
doi:10.1017/s1351324909990143 fatcat:qcovhpwzjzbitkcvoqr4ktl6sy

A Combined Superposition and Model Evolution Calculus

Peter Baumgartner, Uwe Waldmann
2010 Journal of automated reasoning  
Our main result is its completeness under semantically justified redundancy criteria and simplification rules.  ...  It integrates the inference rules of Superposition and of Model Evolution in a non-trivial way while preserving the individual semantically-based redundancy criteria of the two calculi.  ...  in a positive literal of Dγ, hence these rules cannot be used to rewrite terms in positive literals of Dγ.  ... 
doi:10.1007/s10817-010-9214-x fatcat:7jreirdnfvecbdbfxkrdvxon4e
« Previous Showing results 1 — 15 out of 5,030 results