A consequence finding approach for full clausal abduction

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

Volumn 4755 LNAI, Issue , 2007, Pages 173-184

  Ray, Oliver ^a   Inoue, Katsumi ^b  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; FORMAL LOGIC; INFERENCE ENGINES; MATHEMATICAL MODELS; PROBLEM SOLVING;

ABDUCTIVE INFERENCE; NETWORK MODELING; SCIENTIFIC DISCOVERY; SKIP ORDERED LINEAR (SOL) RESOLUTION;

DATA MINING;

EID: 38149084679     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75488-6_17     Document Type: Conference Paper

References (22)

1. Baumgartner, P., Furbach, U., Stolzenburg, F.: Computing Answers with Model Elimination. Artif. Intel. 90(1-2), 135-176 (1997)
2. Burhans, D., Shapiro, S.: Abduction and Question Answering. In: Proc. the IJ-CAI,01 Workshop on Abductive Reasoning, pp. 905-908 (2001)
3. Demolombe, R.: A Strategy for the Computation of Conditional Answers. In: Proc. 10th Europ. Conf. on Artif. Intel. pp. 134-138 (1992)
4. Gartner, J., Swift, T., Tien, A., Damásio, C., Pereira, L.: Psychiatric Diagnosis from the Viewpoint of Computational Logic. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 1362-1376. Springer, Heidelberg (2000)
5. Green, C.: Theorem-Proving by Resolution as a Basis for Question-Answering Systems. Mach. Intel. 4, 183-205 (1969)
6. Hartshorne, C., Weiss, P., Burks, A.W. (eds.): Collected papers of Charles Sanders Peirce. Harvard University Press (1931-1958)
7. Inoue, K.: Linear resolution for Consequence Finding. Artif. Intel. 56(2-3), 301-353 (1992)
8. Iwanuma, K., Inoue, K.: Minimal Answer Computation and SOL. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 245-257. Springer, Heidelberg (2002)
9. Iwanuma, K., Inoue, K., Satoh, K.: Completeness of Pruning Methods for Consequence Finding Procedure SOL. In: Proc. 3rd Int. Workshop on First-Order
10. Theorem Proving, pp. 89-100 (2000)
11. Josephson, J., Josephson, S. (eds.): Abductive Inference: Computation, Philosophy, Technology. Cambridge University Press, Cambridge (1994)
12. Kakas, A., Kowalski, R., Toni, F.: Abductive Logic Programming. Journal of Logic and Computation 2(6), 719-770 (1992)
13. King, R., Whelan, K., Jones, F., Reiser, P., Bryant, C., Muggleton, S., Kell, D., Oliver, S.: Functional Genomic Hypothesis Generation and Experimentation by a Robot Scientist. Nature 427, 247-252 (2004)
14. Lloyd, J.: Foundations of Logic Programming. Springer, Heidelberg (1987)
15. Loveland, D.: Automated Theorem Proving: A Logical Basis, North Holland (1978)
16. Mayer, M., Pirri, F.: First-Order Abduction via Tableau and Sequent Calculi. Bulletin of the IPGL 1(1), 99-117 (1993)
17. Nabeshima, H., Iwanuma, K., Inoue, K.: SOLAR: A Consequence Finding System for Advanced Reasoning. In: Mayer, M.C., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol. 2796, pp. 257-263. Springer, Heidelberg (2003)
18. Papatheodorou, I., Kakas, A., Sergot, M.: Inference of Gene Relations from Microarray Data by Abduction. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 389-393. Springer, Heidelberg (2005)
19. Poole, D.: Compiling a Default Reasoning System into Prolog. New Generation Computing 9(1), 3-38 (1991)
20. Ray, O., Inoue, K.: Mode-Directed Inverse Entailment for Full Clausal Theories. In: Blockeel, H., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS, Springer, Heidelberg (2007)
21. Stickel, M.: A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog. Theoretical Computer Science 104(1), 109-128 (1992)
22. Zupan, B., Demsar, J., Bratko, I., Juvan, P., Halter, J., Kuspa, A., Shaulsky, G.: GenePath: a System for Automated Construction of Genetic Networks from Mutant Data. Bioinformatics 19(3), 383-389 (2003)