Sciweavers

5499 search results - page 41 / 1100
» Generalized Rewrite Theories
Sort
View
JSC
2010
120views more  JSC 2010»
13 years 6 months ago
Theory decision by decomposition
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formu...
Maria Paola Bonacina, Mnacho Echenim
DLOG
2007
13 years 10 months ago
A Proof Theory for DL-Lite
Abstract. In this work we propose an alternative approach to inference in DLLite, based on a reduction to reasoning in an extension of function-free Horn Logic (EHL). We develop a ...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt
ENTCS
2008
114views more  ENTCS 2008»
13 years 7 months ago
Maintaining Coherence Between Models With Distributed Rules: From Theory to Eclipse
Integrated Development Environments supporting software and model evolution have to deal with the problem of maintaining coherence between code and model despite changes which may...
Paolo Bottoni, Francesco Parisi-Presicce, Simone P...
RTA
1995
Springer
13 years 11 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
RTA
2007
Springer
14 years 1 months ago
Tom: Piggybacking Rewriting on Java
We present the Tom language that extends Java with the purpose of providing high level constructs inspired by the rewriting community. Tom furnishes a bridge between a general purp...
Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-...