Sciweavers

2229 search results - page 58 / 446
» The Case for Grounding Databases
Sort
View
AAAI
1994
15 years 2 months ago
Rule Based Updates on Simple Knowledge Bases
In this paper we consider updates that are specified as rules and consider simple knowledge bases consisting of ground atoms. We present a translation of the rule based update spe...
Chitta Baral
DASFAA
2010
IEEE
169views Database» more  DASFAA 2010»
14 years 11 months ago
Fires on the Web: Towards Efficient Exploring Historical Web Graphs
Abstract. Discovery of evolving regions in large graphs is an important issue because it is the basis of many applications such as spam websites detection in the Web, community lif...
Zhenglu Yang, Jeffrey Xu Yu, Zheng Liu, Masaru Kit...
ICTAC
2004
Springer
15 years 6 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
ENTCS
2008
106views more  ENTCS 2008»
15 years 1 months ago
Verifying Test-Hypotheses: An Experiment in Test and Proof
HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. The HOL-TestGen method is two-staged: first, the origina...
Achim D. Brucker, Lukas Brügger, Burkhart Wol...
SIGMOD
2010
ACM
215views Database» more  SIGMOD 2010»
15 years 5 months ago
Dynamic symbolic database application testing
A database application differs form regular applications in that some of its inputs may be database queries. The program will execute the queries on a database and may use any re...
Chengkai Li, Christoph Csallner