Fundamental properties of deterministic and nondeterministic extensions of Datalog
- 21 January 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 78 (1), 137-158
- https://doi.org/10.1016/0304-3975(51)90006-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Fixpoint extensions of first-order logic and datalog-like languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Introduction to Database and Knowledge-Base SystemsPublished by World Scientific Pub Co Pte Ltd ,1992
- Why not negation by fixpoint?Journal of Computer and System Sciences, 1991
- Elements of Relational Database TheoryPublished by Elsevier ,1990
- Data functions, datalog and negationACM SIGMOD Record, 1988
- Procedural and declarative database update languagesPublished by Association for Computing Machinery (ACM) ,1988
- Decidability and expressiveness aspects of logic queriesPublished by Association for Computing Machinery (ACM) ,1987
- Positivism vs minimalism in deductive databasesPublished by Association for Computing Machinery (ACM) ,1985
- Deciding whether a production rule is relational computableLecture Notes in Computer Science, 1983
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980