Academia.eduAcademia.edu

Outline

Abduction with hypotheses confirmation

2005, INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE

Abstract

Abstract. Abduction can be seen as the formal inference corresponding to human hypothesis making. It typically has the purpose of explaining some given observation. In classical abduction, hypotheses could be made on events that may have occurred in the past. In general, abductive reasoning can be used to generate hypotheses about events possibly occurring in the future (forecasting), or may suggest further investigations that will confirm or disconfirm the hypotheses made in a previous step (as in scientific reasoning). We ...

References (28)

  1. Poole, D.L.: A logical framework for default reasoning. Artificial Intelligence 36 (1988) 27-47
  2. Kakas, A.C., Mancarella, P.: On the relation between Truth Maintenance and Abduction. In Fukumura, T., ed.: Proc. PRICAI-90, Nagoya, Japan, Ohmsha Ltd. (1990) 438-443
  3. Console, L., Dupré, D.T., Torasso, P.: On the relationship between abduction and deduction. Journal of Logic and Computation 1 (1991) 661-690
  4. Fung, T.H., Kowalski, R.A.: The IFF proof procedure for abductive logic program- ming. Journal of Logic Programming 33 (1997) 151-165
  5. Kakas, A.C., Michael, A., Mourlas, C.: ACLP: Abductive Constraint Logic Pro- gramming. Journal of Logic Programming 44 (2000) 129-177
  6. Kakas, A.C., van Nuffelen, B., Denecker, M.: A-System: Problem solving through abduction. In Nebel, B., ed.: Proc. 17th IJCAI, Seattle, WA, MKP (2001) 591-596
  7. Jaffar, J., Maher, M.: Constraint logic programming: a survey. Journal of Logic Programming 19-20 (1994) 503-582
  8. The SCIFF abductive proof procedure http://lia.deis.unibo.it/Research/sciff/.
  9. Frühwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming 37 (1998) 95-138
  10. Kunen, K.: Negation in logic programming. In: Journal of Logic Programming. Volume 4. (1987) 289-308
  11. Kakas, A.C., Kowalski, R.A., Toni, F.: The role of abduction in logic program- ming. In Gabbay, D.M., Hogger, C.J., Robinson, J.A., eds.: Handbook of Logic in Artificial Intelligence and Logic Programming. Vol. 5., OUP (1998) 235-324
  12. Jaffar, J., Maher, M., Marriott, K., Stuckey, P.: The semantics of constraint logic programs. Journal of Logic Programming 37(1-3) (1998) 1-46
  13. Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Specification and verification of interaction protocols: a computational logic approach based on ab- duction. Tech. Rep. CS-2003-03, Dip. di Ingegneria, Ferrara, Italy (2003)
  14. Holzbaur, C.: Specification of constraint based inference mechanism through ex- tended unification. Dissertation, Dept. of Medical Cybernetics & AI, University of Vienna (1990)
  15. Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Com- pliance verification of agent interaction: a logic-based tool. In Müller, J., Petta, P., eds.: Proc. (AT2AI-4 -EMCSR'2004 Session M), Vienna, Austria (2004)
  16. Societies Of ComputeeS (SOCS): a computational logic model for the description, analysis and verification of global and open societies of heterogeneous computees http://lia.deis.unibo.it/Research/SOCS/.
  17. Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Modeling interactions using Social Integrity Constraints: a resource sharing case study. In Leite, J.A., Omicini, A., Sterling, L., Torroni, P., eds.: Proc. DALT 2003. Melbourne, Victoria (2003) 81-96
  18. Alberti, M., Daolio, D., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Specifi- cation and verification of agent interaction protocols in a logic-based system. In: Proce. 19th SAC, AIMS Special Track, Nicosa, Cyprus, ACM Press (2004)
  19. Kowalski, R., Toni, F., Wetzel, G.: Executing suspended logic programs. Funda- menta Informaticae 34 (1998) 203-224
  20. Endriss, U., Mancarella, P., Sadri, F., Terreni, G., Toni, F.: Abductive Logic Programming with CIFF. In Bennett, B., ed.: Proc. 11th Workshop on Automated Reasoning, Leeds, UK, (2004) Extended Abstract.
  21. Evans, C., Kakas, A.: Hypotheticodeductive reasoning. In: Proc. Int. Conf. on Fifth Generation Computer Systems, Tokyo (1992) 546-554
  22. Sergot, M.J.: A query-the-user facility of logic programming. In Degano, P., Sandwell, E., eds.: Integrated Interactive Computer Systems, North Holland (1983) 27-41
  23. Satoh, K., Inoue, K., Iwanuma, K., Sakama, C.: Speculative computation by ab- duction under incomplete communication environments. In: Proc. 4th ICMAS, Boston, USA, IEEE Press (2000) 263-270
  24. Satoh, K., Yamamoto, K.: Speculative computation with multi-agent belief revi- sion. In Castelfranchi, C., Lewis Johnson, W., eds.: Proc. AAMAS-2002, Part II, Bologna, Italy, ACM Press (2002) 897-904
  25. Abdennadher, S., Christiansen, H.: An experimental CLP platform for integrity constraints and abduction. In Larsen, H., Kacprzyk, J., Zadrozny, S., Andreasen, T., Christiansen, H., eds.: FQAS, Flexible Query Answering Systems. LNCS, War- saw, Poland, Springer (2000) 141-152
  26. Gavanelli, M., Lamma, E., Mello, P., Milano, M., Torroni, P.: Interpreting ab- duction in CLP. In Buccafurri, F., ed.: APPIA-GULP-PRODE Joint Conf. on Declarative Programming, Reggio Calabria, Italy, (2003) 25-35
  27. Lloyd, J.W.: Foundations of Logic Programming. 2nd extended edn. Springer- Verlag (1987)
  28. Bürckert, H.: A resolution principle for constrained logics. Artificial Intelligence 66 (1994) 235-271