Weak Generalized Closed World Assumption
- 1 September 1989
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 5 (3), 293-307
- https://doi.org/10.1007/bf00248321
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Procedural interpretation of non-horn logic programsPublished by Springer Nature ,2005
- On indefinite databases and the closed world assumptionPublished by Springer Nature ,2005
- Inferring negative information from disjunctive databasesJournal of Automated Reasoning, 1988
- Closures and fairness in the semantics of programming logicTheoretical Computer Science, 1984
- Foundations of Logic ProgrammingPublished by Springer Nature ,1984
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- An extension to linear resolution with selection functionInformation Processing Letters, 1982
- On Closed World Data BasesPublished by Springer Nature ,1978
- Negation as FailurePublished by Springer Nature ,1978
- Linear resolution with selection functionArtificial Intelligence, 1972