138 search results - page 9 / 28 » DATALOG with Nested Rules |
LPNMR
1999
Springer
15 years 3 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
118
Voted
TABLEAUX
2009
Springer
15 years 6 months ago
2009
Springer
We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t, b, 4, 5. These systems are modular in the sense that each axiom has a c...
119
click to vote
JAR
2010
14 years 6 months ago
2010
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
A runtime approach to model-generic translation of schema and data is proposed. It is based on our previous work on MIDST, a platform conceived to perform translations in an off-...
104
Voted
PODS
2010
ACM
15 years 1 months ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....