Linear resolution for consequence finding

Artificial Intelligence

Volumn 56, Issue 2-3, 1992, Pages 301-353

  Inoue, Katsumi ^a  

^a ICOT Research Center Institute for New Generation Computer Technology ^*  (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY - COMPUTATIONAL LINGUISTICS; MATHEMATICAL PROGRAMMING, LINEAR; SWITCHING THEORY;

ABDUCTION; CHARACTERISTIC CLAUSES; CONSEQUENCE FINDING; MODEL ELIMINATION PROCEDURE; SOL RESOLUTION;

AUTOMATA THEORY;

EID: 0026904748     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(92)90030-2     Document Type: Article

References (51)

1. Saturation, nonmonotonic reasoning, and the closed-world assumption
2. Causes for events: their computation and applications
3. An assumption-based TMS
4. A comparison of ATMS and CSP techniques
5. Characterizing diagnoses
6. An inference rule for hypothesis generation
7. Exploiting constraints in design synthesis
8. On the relationship between circumscription and negation as failure
9. A circumscriptive theorem prover
10. Query answering in circumscription
11. Plan recognition as abduction and relevance
12. Interpretation as abduction
13. An abductive procedure for the CMS/ATMS
14. Consequence-finding based on ordered linear resolution
15. On theorem provers for circumscription
16. A computation method for parallel circumscription based on equivalent transformation of queries
17. Computing the extensions of autoepistemic and default logics with a truth maintenance system
18. An incremental method for generating prime implicants/implicates
19. Semantic trees in automatic theorem-proving
20. Linear resolution with selection function
21. A completeness theorem and computer program for finding theorems derivable from given axioms
22. A knowledge-level account of abduction (preliminary version)
23. Computing circumscription
24. A simplified format for the model elimination theorem-proving procedure
25. Circumscription—a form of non-monotonic reasoning
26. A note on linear resolution strategies in consequence-finding
27. A fixpoint semantics for disjunctive logic programs
28. A logical framework for default reasoning
29. Explanation and prediction an architecture for default and abductive reasoning
30. Compiling a default reasoning system into Prolog
31. Theorist: a logical reasoning system for defaults and diagnosis
32. On the mechanization of abductive logic
33. The computational complexity of multiple-context truth maintenance systems
34. An algorithm to compute circumscription
35. The problem of simplifying truth functions
36. Two results on ordering for resolution with merging and linear format
37. Foundations of assumption-based truth maintenance systems: preliminary report
38. A machine-oriented logic based on the resolution principle
39. What's in a consistency tree: a uniform treatment of theory selection
40. Abductive and default reasoning: a computational core
41. Refutation graphs
42. Représentation et utilisation de la connaissance en calcul propositionnel
43. Completeness theorems for semantic resolution in consequence-finding
44. A Prolog technology theorem prover: implementation by an extended Prolog compiler
45. Rationale and methods for abductive reasoning in natural-language interpretation
46. Generalized consensus theory and application to the minimization of boolean functions
47. Case inference in resolution-based languages