Linear resolution for consequence finding
References (51)
- et al.
Saturation, nonmonotonic reasoning, and the closed-world assumption
Artif. Intell.
(1985) An assumption-based TMS
Artif. Intell.
(1986)- et al.
On the relationship between circumscription and negation as failure
Artif. Intell.
(1989) A circumscriptive theorem prover
Artif. Intell.
(1989)- et al.
An incremental method for generating prime implicants/implicates
J. Symbolic Comput.
(1990) - et al.
Linear resolution with selection function
Artif. Intell.
(1971) Circumscription—a form of non-monotonic reasoning
Artif. Intell.
(1980)- et al.
A note on linear resolution strategies in consequence-finding
Artif. Intell.
(1972) - et al.
A fixpoint semantics for disjunctive logic programs
J. Logic Program.
(1990) A logical framework for default reasoning
Artif. Intell.
(1988)
An algorithm to compute circumscription
Artif. Intell.
(1989)
Refutation graphs
Artif. Intell.
(1976)
Causes for events: their computation and applications
A comparison of ATMS and CSP techniques
Characterizing diagnoses
An inference rule for hypothesis generation
Exploiting constraints in design synthesis
Query answering in circumscription
Plan recognition as abduction and relevance
Interpretation as abduction
An abductive procedure for the CMS/ATMS
Consequence-finding based on ordered linear resolution
On theorem provers for circumscription
A computation method for parallel circumscription based on equivalent transformation of queries
Reports of the Group for Computation IEICE Japan
No. COMP89-42
(1989)
Cited by (0)
Copyright © 1992 Published by Elsevier B.V.