Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
On generating all maximal independent sets
Information Processing Letters
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
Negation as failure using tight derivations for general logic programs
Journal of Logic Programming
Logic programming and databases
Logic programming and databases
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
Journal of Computer and System Sciences
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Journal of the ACM (JACM)
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
Listing graphs that satisfy first-order sentences
Journal of Computer and System Sciences
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Non-deterministic languages to express deterministic transformations
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantics and expressive power of nondeterministic constructs in deductive databases
Journal of Computer and System Sciences
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
IEEE Transactions on Knowledge and Data Engineering
Active Database Rules with Transaction-Conscious Stable-Model Semantics
DOOD '95 Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases
CORAL - Control, Relations and Logic
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Search and Optimization Problems in Datalog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Theory and Practice of Logic Programming
Event choice datalog: a logic programming language for reasoning in multiple dimensions
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Hi-index | 0.00 |
This paper presents a rule-based database language which extends stratified DATALOG by adding a controlled form of inflationary fixpoint, immersed in a context of classical stratified negation with least fixpoint. The proposed language, called Semi-Inflationary DATALOG (DATALOG @(*) for short), smoothly combines the declarative purity of stratified negation with the procedural style of the inflationary fixpoint, DATALOG @(*) is particularly suitable to express algorithms in a mixed style: declarative rules, whenever it is natural and convenient, and procedural ones, any time it is easier to list the sequence of single actions. In the latter case, in order not to oblige the programmer to supply unnecessary procedural details, a number of choice constructs are available to express don't care non-determinism. The semantics of a DATALOG @(*) program is given using stable models by means of rule rewriting into a DATALOG program with choice and XY-stratification. In addition the complexity and expressive power of DATALOG @(*) queries is precisely characterized and some lights are put on the related class NQPTIME as well.