Fixpoint extensions of first-order logic and datalog-like languages
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Elements of Relational Database TheoryPublished by Elsevier ,1990
- Why not negation by fixpoint?Published by Association for Computing Machinery (ACM) ,1988
- Procedural and declarative database update languagesPublished by Association for Computing Machinery (ACM) ,1988
- Relative Information Capacity of Simple Relational Database SchemataSIAM Journal on Computing, 1986
- Relational queries computable in polynomial timeInformation and Control, 1986
- Fixed-point extensions of first-order logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Programming primitives for database languagesPublished by Association for Computing Machinery (ACM) ,1981
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979