Linear resolution for consequence finding
- 31 August 1992
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 56 (2-3), 301-353
- https://doi.org/10.1016/0004-3702(92)90030-2
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A fixpoint semantics for disjunctive logic programsThe Journal of Logic Programming, 1990
- An incremental method for generating prime implicants/implicatesJournal of Symbolic Computation, 1990
- A circumscriptive theorem proverArtificial Intelligence, 1989
- On the relationship between circumscription and negation as failureArtificial Intelligence, 1989
- An assumption-based TMSArtificial Intelligence, 1986
- Saturation, nonmonotonic reasoning and the closed-world assumptionArtificial Intelligence, 1985
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980
- Linear resolution with selection functionArtificial Intelligence, 1972
- A note on linear resolution strategies in consequence-findingArtificial Intelligence, 1972
- A Simplified Format for the Model Elimination Theorem-Proving ProcedureJournal of the ACM, 1969