Sciweavers

226 search results - page 25 / 46
» Extensional Theories and Rewriting
Sort
View
SIGIR
2012
ACM
11 years 11 months ago
Automatic suggestion of query-rewrite rules for enterprise search
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
Zhuowei Bao, Benny Kimelfeld, Yunyao Li
CADE
2006
Springer
14 years 9 months ago
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Florent Jacquemard, Laurent Vigneron, Michaël...
DLOG
2007
13 years 11 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 9 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
14 years 10 days 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...