Embedding negation as failure into a model generation theorem prover
- 1 January 1992
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On indefinite databases and the closed world assumptionPublished by Springer Nature ,2005
- Classical negation in logic programs and disjunctive databasesNew Generation Computing, 1991
- The structure of norm conditions and nonmonotonic reasoning in lawPublished by Association for Computing Machinery (ACM) ,1991
- Stable models and non-determinism in logic programs with negationPublished by Association for Computing Machinery (ACM) ,1990
- SATCHMO: A theorem prover implemented in PrologPublished by Springer Nature ,1987
- Saturation, nonmonotonic reasoning and the closed-world assumptionArtificial Intelligence, 1985
- Foundations of Logic ProgrammingPublished by Springer Nature ,1984
- A logic for default reasoningArtificial Intelligence, 1980