Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Amortized efficiency of a path retrieval data structure
Theoretical Computer Science
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Faster scaling algorithms for network problems
SIAM Journal on Computing
Introduction to algorithms
Testing logic programs for local stratification
Theoretical Computer Science
Towards a unified theory of intensional logic programming
Journal of Logic Programming
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
Advanced database systems
Stratified negation in temporal logic programming and the cycle-sum test
Theoretical Computer Science
The Branching-Time Transformation Technique for Chain Datalog Programs
Journal of Intelligent Information Systems
Efficient Recursive Aggregation and Negation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Nondeterministic, Nonmonotonic Logic Databases
IEEE Transactions on Knowledge and Data Engineering
An Overview of Temporal and Modal Logic Programming
ICTL '94 Proceedings of the First International Conference on Temporal Logic
An Operational Semantics of Starlog
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
The deductive database system ℒ𝒟ℒ++
Theory and Practice of Logic Programming
Branching-time logic programming: the language Cactus and its applications
Computer Languages
Locally stratified Boolean grammars
Information and Computation
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Expressive policy analysis with enhanced system dynamicity
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Hi-index | 5.23 |
We consider the problem of extending temporal deductive databases with stratified negation. We argue that the classical stratification test for deductive databases is too restrictive when one shifts attention to the temporal case. Moreover, as we demonstrate, the (more general) local stratification approach is impractical: detecting whether a temporal deductive database is locally stratified is shown to be co-NP hard (even if one restricts attention to programs that only use one predicate symbol and two constants). For these reasons we define temporal stratification, an intermediate notion between stratification and local stratification. We demonstrate that for the temporal deductive databases we consider, temporal stratification coincides with local stratification in certain important cases in which the latter is polynomial-time decidable. We then develop two algorithms for detecting temporal stratification. The first algorithm applies to linear-time temporal deductive databases and it is efficient and more general than existing approaches; however, the algorithm sacrifices completeness for efficiency since it does not cover the whole class of temporally stratified programs. The second algorithm applies to branching-time temporal deductive databases (which include as a special case the linear-time ones). This algorithm is more expensive from a computational point of view, but it covers the whole class of temporally stratified programs. We discuss the relative merits of the two algorithms and compare them with other existing approaches.