138 search results - page 9 / 28 » DATALOG with Nested Rules |
148
Voted
LPNMR
1999
Springer
15 years 10 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...
179
Voted
TABLEAUX
2009
Springer
16 years 10 days 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...
188
click to vote
JAR
2010
15 years 18 days 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 ...
124
click to vote
EDBT
2009
ACM
16 years 18 days 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-...
170
click to vote
PODS
2010
ACM
15 years 7 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....