Hypotheses finding via residue hypotheses with the resolution principle

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1968, Issue , 2000, Pages 156-165

  Yamamoto, Akihiro ^a,b   Fronhöfer, Bertram ^c  

^a HOKKAIDO UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

TERMINOLOGY;

CONNECTION METHOD; HYPOTHESIS FINDING; INDUCTIVE INFERENCE; LOGICAL FORMULAS; RESOLUTION PRINCIPLE;

COMPUTATION THEORY;

EID: 84974661165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40992-0_12     Document Type: Conference Paper

References (19)

1. H. Arimura. Learning Acyclic First-order Horn Sentences From Implication, In Proceedings of the 8th International Workshop on Algorithmic Learning Theory(LNAI 1316), pages 432-445, 1997.
2. W. Bibel. Deduction: Automated Logic. Academic Press, 1993.
3. C.-L. Chang and R. C.-T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973.
4. B. Fronhöfer and A. Yamamoto. Relevant Hypotheses as a Generalization of the Bottom Method. In Proceedings of the Joint Workshop of SIG-FAI and SIG-KBS, SIG-FAI/KBS-9902, pages 89-96. JSAI, 1999.
5. B. Fronhöfer and A. Yamamoto. Hypothesis Finding with Proof Theoretical Appropriateness Criteria. Submitted to the AI journal, 2000.
6. K. Inoue. Linear Resolution for Consequence Finding. Artificial Intelligence, 56:301-353, 1992.
7. R.C.T. Lee. A Completeness Theorem and Computer Program for Finding Theorems Derivable from Given Axioms. PhD thesis, University of California, Berkeley, 1967.
8. A. Leitsch. The Resolution Calculus. The Resolution Calculus, 1997.
9. S. Muggleton. Inverse Entailment and Progol. New Generation Computing, 13:245-286, 1995.
10. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1993.
11. G. D. Plotkin. A Further Note on Inductive Generalization. In Machine Intelligence 6, pages 101-124. Edinburgh University Press, 1971.
12. D. Poole. A Logical Framework for Default Reasoning. Artificial Intelligence, 36:27-47, 1988.
13. C. Rouveirol. Extensions of Inversion of Resolution Applied to Theory Completion. In S. Muggleton, editor, Inductive Logic Programming, pages 63-92. Academic Press, 1992.
14. T. Sato and S. Akiba. Inductive Resolution. In Proceedings of the 4th International Workshop on Inductive Logic Programming (LNAI 744), pages 101-110. Springer-Verlag, 1993.
15. A. Yamamoto. Representing Inductive Inference with SOLD-Resolution. In Proceedings of the IJCAI’97 Workshop on Abduction and Induction in AI, pages 59-63, 1997.
16. A. Yamamoto. Which Hypotheses Can Be Found with Inverse Entailment? In Proceedings of the 7th International Workshop on Inductive Logic Programming (LNAI 1297), pages 296-308, 1997. The extended abstract is in Proceedings of the IJCAI’97 Workshop on Frontiers of Inductive Logic Programming, pp.19-23 (1997).
17. A. Yamamoto. Logical Aspects of Several Bottom-up Fittings. In Proceedings of the 9th International Workshop on Algorithmic Learning Theory (LNAI 1501), pages 158-168, 1998.
18. A. Yamamoto. An Inference Method for the Complete Inverse of Relative Subsumption. New Generation Computing, 17(1):99-117, 1999.
19. A. Yamamoto. Revising the Logical Foundations of Inductive Logic Programming Systems with Ground Reduced Programs. New Generation Computing, 17(1):119-127, 1999.