Sciweavers

96 search results - page 2 / 20
» Conditional Term Rewriting as a Deductive Database Language
Sort
View
WADT
1998
Springer
13 years 9 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...
PODS
2005
ACM
104views Database» more  PODS 2005»
14 years 5 months ago
Views and queries: determinacy and rewriting
We investigate the question of whether a query can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines if V pr...
Luc Segoufin, Victor Vianu
ENTCS
2006
114views more  ENTCS 2006»
13 years 5 months ago
Prototyping SOS Meta-theory in Maude
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formul...
Mohammad Reza Mousavi, Michel A. Reniers
JAPLL
2010
179views more  JAPLL 2010»
13 years 3 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
ESWS
2008
Springer
13 years 7 months ago
Numeric reasoning in the Semantic Web
Abstract. The Semantic Web is an effort by the W3C to enable integration and sharing of information across different applications and organizations using annotations by means of on...
Chimène Fankam, Stéphane Jean, Guy P...