Compiling circumscriptive theories into logic programs
- 1 January 1989
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the Declarative Semantics of Deductive Databases and Logic ProgramsPublished by Elsevier BV ,1988
- On the Declarative Semantics of Logic Programs with NegationPublished by Elsevier BV ,1988
- Negation as Failure Using Tight Derivations for General Logic ProgramsPublished by Elsevier BV ,1988
- Negation as failure: Careful closure procedureArtificial Intelligence, 1986
- Applications of circumscription to formalizing common-sense knowledgeArtificial Intelligence, 1986
- Saturation, nonmonotonic reasoning and the closed-world assumptionArtificial Intelligence, 1985
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980
- Negation as FailurePublished by Springer Science and Business Media LLC ,1978
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- Theorem-Proving for Computers: Some Results on Resolution and RenamingThe Computer Journal, 1966