Non-determinism in logic-based languages
- 1 June 1991
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 3 (2-4), 151-186
- https://doi.org/10.1007/bf01530924
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Fixpoint extensions of first-order logic and datalog-like languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Procedural languages for database queries and updatesJournal of Computer and System Sciences, 1990
- Non-deterministic languages to express deterministic transformationsPublished by Association for Computing Machinery (ACM) ,1990
- A transaction-based approach to relational database specificationJournal of the ACM, 1989
- Procedural and declarative database update languagesPublished by Association for Computing Machinery (ACM) ,1988
- THE CONNECTION OF STATIC CONSTRAINTS WITH DETERMINISM AND BOUNDEDNESS OF DYNAMIC SPECIFICATIONSPublished by Elsevier ,1988
- The Implication Problem for Functional and Inclusion Dependencies is UndecidableSIAM Journal on Computing, 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