A database needs two kinds of negation
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 357-371
- https://doi.org/10.1007/3-540-54009-1_25
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Well-Founded Semantics Coincides with Three-Valued Stable Semantics1Fundamenta Informaticae, 1990
- Automatic theorem proving in paraconsistent logics: Theory and implementationPublished by Springer Nature ,1990
- Weak Generalized Closed World AssumptionJournal of Automated Reasoning, 1989
- On the declarative and procedural semantics of logic programsJournal of Automated Reasoning, 1989
- Unfounded sets and well-founded semantics for general logic programsPublished by Association for Computing Machinery (ACM) ,1988
- On the Declarative Semantics of Deductive Databases and Logic ProgramsPublished by Elsevier ,1988
- A relational model of data for large shared data banksCommunications of the ACM, 1970