Results 1 -
3 of
3
Semantics and Expressive Power of Non-Deterministic Constructs in Deductive Databases
, 1996
"... this paper, ..."
DATALOG Queries with Stratified Negation and Choice: from P to D^P
, 1995
"... This paper introduces a unified solution to the problem of extending stratified DATALOG to express DB-complexity classes ranging from P to D^P. The solution... ..."
Abstract
-
Cited by 17 (7 self)
- Add to MetaCart
This paper introduces a unified solution to the problem of extending stratified DATALOG to express DB-complexity classes ranging from P to D^P. The solution...
Guarded Quantification in Least Fixed Point Logic
, 2002
"... We develop a variant of Least Fixed Point logic based on First Order logic with a relaxed version of guarded quantification. We develop a Game Theoretic Semantics of this logic, and find that under reasonable conditions, guarding quantification does not reduce the expressibility of Least Fixed Point ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
We develop a variant of Least Fixed Point logic based on First Order logic with a relaxed version of guarded quantification. We develop a Game Theoretic Semantics of this logic, and find that under reasonable conditions, guarding quantification does not reduce the expressibility of Least Fixed Point logic. But guarding quantification increases worst-case time complexity.
