Verifiable agent interaction in abductive logic programming: The SCIFF framework

ACM Transactions on Computational Logic

Volumn 9, Issue 4, 2008, Pages

  Alberti, Marco ^a   Chesani, Federico ^b   Gavanelli, Marco ^a   Lamma, Evelina ^a   Mello, Paola ^b   Torroni, Paolo ^b  

^a UNIVERSITY OF FERRARA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Abductive logic programming; Agent interaction protocols; Declarative semantics; Formal properties; IFF proof procedure; Proof procedures; SCIFF; SOCS (SOcieties of ComputeeS)

Indexed keywords

ABDUCTIVE LOGIC PROGRAMMING; AGENT INTERACTION PROTOCOLS; DECLARATIVE SEMANTICS; FORMAL PROPERTIES; IFF PROOF PROCEDURE; PROOF-PROCEDURES; SCIFF; SOCS (SOCIETIES OF COMPUTEES);

FLOW INTERACTIONS; INFORMATION THEORY; LINGUISTICS; LOGIC PROGRAMMING; SEMANTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 51149086600     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1380572.1380578     Document Type: Article

References (82)

1. ABADi, M. AND BLANCHET, B. 2005. Analyzing security protocols with secrecy types and logic programs. J. ACM 52, 1, 102-146.
2. ALBERTI, M. AND CHESANI, F. 2005. The computational behaviour of the SCIFF abductive proof procedure and the SOCS-SI system. Intelligenza Artificiale II, 3 (Sept.), 45-51.
3. ALBERTI, M., CHESANI, F., GAVANELLI, M., AND LAMMA, E. 2005. The CHR-based implementation of a system for generation and confirmation of hypotheses, A. Wolf, T. Frühwirth, and M. Meister, Eds. Ulmer Informatik-Berichte, vol. 2005-01, Ulm University, Ulm, Germany, 111-122.
4. ALBERTI, M.,CHESANI, F.,GAVANELLI, M., LAMMA, E., MELLO, P., AND MONTALI, M. 2006a. Anabductive framework for a-priori verification of Web services. In Proceedings of the Eighth Symposium on Principles and Practice of Declarative Programming (July 10-12, 2006, Venice, Italy). M. Maher, Ed. ACM Press, New York, NY, 39-50.
5. ALBERTI, M., CHESANI, F., GAVANELLI, M., LAMMA, E., MELLO, P., AND TORRONI, P. 2006b. Compliance verification of agent interaction: A logic-based tool. Appl. Artific. Intell. 20, 2-4 (Feb.-Apr.), 133-157.
6. ALBERTI, M., CHESANI, F., GAVANELLI, M., LAMMA, E., MELLO, P., AND TORRONI, P. 2006c. Security protocols verification in abductive logic programming: A case study. In ESAW 2005 Post-proceedings, O. Dikenelli, M.-P. Gleizes, and A. Ricci, Eds. Lecture Notes in Artificial Intelligence, vol. 3963. Springer-Verlag, Berlin, Germany, 106-124.
7. ALBERTI, M., GAVANELLI, M., LAMMA, E., MELLO, P., SARTOR, G., AND TORRONI, P. 2006d. Mapping deontic operators to abductive expectations. Computat. Math. Organiz. Theor. 12, 2-3 (Oct.), 205-225.
8. ALBERTI, M., GAVANELLI, M., LAMMA, E., MELLO, P., AND TORRONI, P. 2003. An abductive interpretation for open agent societies. In AI*IA 2003: Advances in Artificial Intelligence, Proceedings of the 8th Congress of the Italian Association for Artificial Intelligence, Pisa, A. Cappelli and F. Turini, Eds. Lecture Notes in Artificial Intelligence, vol. 2829. Springer-Verlag, Berlin, Germany, 287-299.
9. ALFERES, J., PEREIRA, L. M., AND SWIFT, T. 2004. Abduction in well-founded semantics and generalized stable models via tabled dual programs. Theor. Pract. Log. Program. 4, 383-428.
10. ALFERES, J. J., BROGI, A., LEITE, J. A., AND PEREIRA, L. M. 2002. Evolving logic programs. In Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA'02), S. Flesca, S. Greco, N. Leone, and G. Ianni, Eds. Lecture Notes in Artificial Intelligence, vol. 2424. Springer-Verlag, Berlin, Germany, 50-61.
11. ANDERSON, A. 1958. A reduction of deontic logic to alethic modal logic. Mind 67, 100-103.
12. APT, K. R. AND BEZEM, M. 1991. Acyclic programs. New Gen. Comput. 9, 3/4, 335-364.
13. APT, K. R. AND BOL, R. N. 1994. Logic programming and negation: A survey. J. Log. Program. 19/20, 9-71.
14. ARISHA, K. A., OZCAN, F., ROSS, R., SUBRAHMANIAN, V. S., EITER, T., AND KRAUS, S. 1999. IMPACT: A platform for collaborating agents. IEEE Intell. Syst. 14, 2 (Mar./Apr.), 64-72.
15. ARTIKIS, A., PITT, J., AND SERGOT, M. 2002. Animated specifications of computational societies. In Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2002), Part III, C. Castelfranchi and W. Lewis Johnson, Eds. ACM Press, New York, NY, 1053-1061.
16. BLANCHET, B. 2001. An efficient cryptographic protocol verifier based on Prolog rules. In Proceedings of CSFW. IEEE Computer Society, Press, Los Alamitos, CA, 82-96.
17. BORDINI, R. H., FISHER, M., VISSER, W., AND WOOLDRIDGE, M. 2006. Verifying multi-agent programs by model checking. Auton. Agents Multi-Agent Syst. 12, 2, 239-256.
18. BÜRCKERT, H. 1994. A resolution principle for constrained logics. Artific. Intell. 66, 235-271.
19. CASTELFRANCHI, C. 1995. Commitments: From individual intentions to groups and organizations. In Proceedings of the First International Conference on Multiagent Systems, San Francisco, California, USA. AAAI Press, Menlo Porle, CA, 41-48.
20. CHEN, W. AND WARREN, D. S. 1996. Tabled evaluation with delaying for general logic programs. J. ACM 43, 1 (Jan.), 20-74.
21. CLARK, K. L. 1978. Negation as failure. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum Press, New York, NY, 293-322.
22. COHEN, P. R. AND PERRAULT, C. R. 1979. Elements of a plan-based theory of speech acts. Cog. Sci. 3, 3.
23. COLOMBETTI, M., FORNARA, N., AND VERDICCHIO, M. 2004. A social approach to communication in multiagent systems. In Declarative Agent Languages and Technologies, J. A. Leite, A. Omicini, L. Sterling, and P. Torroni, Eds. Lecture Notes in Artificial Intelligence, vol. 2990. Springer-Verlag, Berlin, Germany, 191-220. First International Workshop, DALT 2003. Melbourne, Australia, July 2003. Revised selected and invited papers.
24. CONSOLE, L., DUPRÉ, D. T., AND TORASSO, P. 1991. On the relationship between abduction and deduction. J. Log. Computat. 1, 5, 661-690.
25. DELL'ACQUA, P., SADRI, F., AND TONI, F. 1998. Combining introspection and communication with rationality and reactivity in agents. In Logics in Artificial Intelligence, European Workshop, JELIA'98, Dagstuhl, Germany, October 12-15, 1998, Proceedings, J. Dix, L. Fariñas del Cerro, and U. Furbach, Eds. Lecture Notes in Computer Science, vol. 1489. Springer-Verlag, Berlin, Germany, 17-32.
26. DENECKER, M. AND DE SCHREYE, D. 1992. SLDNFA: An abductive procedure for normal abduc-tive programs. In Proceedings of the Joint International Conference and Symposium on Logic Programming, Washington, USA, K. R. Apt, Ed. MIT Press, Cambridge, MA, 686-702.
27. DENECKER, M. AND DE SCHREYE, D. 1993. Representing incomplete knowledge in abductive logic programming. In Logic Programming, Proceedings of the 1993 International Symposium, Vancouver, British Columbia, Canada. MIT Press, Cambridge, MA, 147-163.
28. DENECKER, M. AND DE SCHREYE, D. 1998. SLDNFA: An abductive procedure for abductive logic programs. J. Log. Program. 34, 2, 111-167.
29. DIGNUM, V., MEYER, J. J., AND WEIGAND, H. 2002. Towards an organizational model for agent societies using contracts. In Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2002), Part II, C. Castelfranchi and W. Lewis Johnson, Eds. ACM Press, New York, NY, 694-695.
30. EITER, T., SUBRAHMANIAN, V., AND PICK, G. 1999. Heterogeneous active agents, I: Semantics. Artific. Intell. 108, 1-2 (Mar.), 179-255.
31. ENDRISS, U., MANCARELLA, P., SADRI, F., TERRENI, G., AND TONI, F. 2004. The CIFF proof procedure for abductive logic programming with constraints. In Logics in Artificial Intelligence, 9th European Conference, JELIA 2004, Lisbon, Portugal, September 27-30, 2004, Proceedings, J. J. Alferes and J. A. Leite, Eds. Lecture Notes in Artificial Intelligence, vol. 3229. Springer-Verlag, Berlin, Germany, 31-43.
32. ESHGHI, K. AND KOWALSKI, R. A. 1989. Abduction compared with negation by failure. In Proceedings of the 6th International Conference on Logic Programming, G. Levi and M. Martelli, Eds. MIT Press, Cambridge, MA, 234-255.
33. EVANS, C. AND KAKAS, A. 1992. Hypotheticodeductive reasoning. In Proceedings of the International Conference on Fifth Generation Computer Systems (Tokyo). 546-554.
34. FIPA. 2001. FIPA Communicative Act Library Specification. Experimental specification XC00037H, Foundation for Intelligent Physical Agents. Aug. Published on August 10, 2001; available for download from the FIPA Web site, http://www.fipa.org.
35. FIPA. 2002. FIPA Request Interaction Protocol Specification. Standard SC00026H, Foundation for Intelligent Physical Agents. Dec. Published on December 3, 2002; available for download from the FIPA Web site, http://www.fipa.org.
36. FORNARA, N. AND COLOMBETTI, M. 2002. Operational specification of a commitment-based agent communication language. In Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2002), Part II, C. Castelfranchi and W. Lewis Johnson, Eds. ACM Press, New York, NY, 535-542.
37. FORNARA, N. AND COLOMBETTI, M. 2003. Defining interaction protocols using a commitment-based agent communication language. In Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2003), J. S. Rosenschein, T. Sandholm, M. Wooldridge, and M. Yokoo, Eds. ACM Press, New York, NY, 520-527.
38. FRÜHWIRTH, T. 1998. Theory and practice of constraint handling rules. J. Log. Program. 37, 1-3 (Oct.), 95-138.
39. FUNG, T. H. 1996. Abduction by deduction. Ph.D. dissertation, Imperial College London, London, U.K.
40. FUNG, T. H. AND KOWALSKI, R. A. 1997. The IFF proof procedure for abductive logic programming. J. Log. Program. 33, 2 (Nov.), 151-165.
41. GAVANELLI, M., LAMMA, E., AND MELLO, P. 2005a. Proof of completeness of the SCIFF proof-procedure. Tech. rep. CS-2005-02. Dipartimento di Ingegneria, Università di Ferrara, Ferrara, Italy. Available at online http://www.ing.unife.it/informatica/tr/CS-2005-02. pdf.
42. GAVANELLI, M., LAMMA, E., AND MELLO, P. 2005b. Proof of properties of the SCIFF proof-procedure. Tech. rep. CS-2005-01. Dipartimento di Ingegneria, Università di Ferrara, Ferrara, Italy. Available online at http://www.ing.unife.it/informatica/tr/CS-2005-01. pdf.
43. HOLZMANN, G. J. 1997. The model checker SPIN. IEEE Trans. Softw. Eng. 23, 5 (May), 279-295.
44. JAFFAR, J. AND MAHER, M. 1994. Constraint logic programming: A survey. J. Log. Program. 19-20, 503-582.
45. KAKAS, A., MANCARELLA, P., SADRI, F., STATHIS, K., AND TONI, F. 2004. The KGP model of agency. In Proceedings of the Sixteenth European Conference on Artificial Intelligence, Valencia, Spain (ECAI 2004), R. Lopez de Mantaras and L. Saitta, Eds. IOS Press, Amsterdam, The Netherlands.
46. KAKAS, A. C., KOWALSKI, R. A., AND TONI, F. 1993. Abductive logic programming. J. Log. Computat. 2, 6, 719-770.
47. KAKAS, A. C. AND MANCARELLA, P. 1990. Onthe relation between truth maintenance and abduction. In Proceedings of the 1st Pacific Rim International Conference on Artificial Intelligence, PRICAI-90, Nagoya, Japan, T. Fukumura, Ed. Ohmsha Ltd., Tokyo, Japan, 438-443.
48. KAKAS, A. C., MICHAEL, A., AND MOURLAS, C. 2000. ACLP: Abductive constraint logic programming. J. Log. Program. 44, 1-3 (July), 129-177.
49. KAKAS, A. C., VAN NUFFELEN, B., AND DENECKER, M. 2001. A-System: Problem solving through abduction. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, Seattle, Washington, USA (IJCAI-01), B. Nebel, Ed. Morgan Kaufmann Publishers, San Francisco, CA, 591-596.
50. KOWALSKI, R., TONI, F., AND WETZEL, G. 1998a. Executing suspended logic programs. Fundamenta Informaticae 34, 203-224.
51. KOWALSKI, R. A. 2006. The logical way to be artificially intelligent. In Computational Logic in Multi-Agent Systems, 6th International Workshop, CLIMA VI, London, UK, June 27-29, 2005, Revised Selected and Invited Papers, P. Torroni and F. Toni, Eds. Lecture Notes in Artificial Intelligence, vol. 3900. Springer-Verlag, Berlin, Germany.
52. KOWALSKI, R. A. AND SADRI, F. 1999. From logic programming towards multi-agent systems. Ann. Math. Artific. Intell. 25, 3/4, 391-419.
53. KOWALSKI, R. A., SADRI, F., AND TONI, F. 1998b. An agent architecture that combines backward and forward reasoning. In Proceedings of the CADE-15 Workshop on Strategies in Automated Deduction, B. Gramlich and F. Pfenning, Eds. 49-56.
54. KUNEN, K. 1987. Negation in logic programming. J. Log. Program. 4. 289-308.
55. LLOYD, J. W. 1987. Foundations of Logic Programming, 2nd extended ed. Springer-Verlag, Berlin, Germany.
56. MANCARELLA, P. AND TERRENI, G. 2003. An abductive proof procedure handling active rules. In AI*IA 2003: Advances in Artificial Intelligence, Proceedings of the 8th Congress of the Italian Association for Artificial Intelligence, Pisa, A. Cappelli and F. Turini, Eds. Lecture Notes in Artificial Intelligence, vol. 2829. Springer-Verlag, Berlin, Germany, 105-117.
57. MEYER, J. J. C. 1988. A different approach to deontic logic: Deontic logic viewed as a variant of dynamic logic. Notre Dame J. Form. Log. 29, 1, 109-136.
58. PRAKKEN, H. AND SERGOT, M. 1996. Contrary-to-duty obligations. Studia Logica 57, 1, 91-115.
59. REITER, R. 1978. On closed-word data bases. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum Press, New York, NY, 55-76.
60. RYU, Y. U. AND LEE, R. M. 1993. Defeasible deontic reasoning: A logic programming model. In Deontic Logic in Computer Science: Normative System Specification, J.-J. Meyer and R. Wieringa, Eds. John Wiley & Sons New York, NY, 225-241.
61. SADRI, F. AND TONI, F. 2000. Abduction with negation as failure for active and reactive rules. In AI*IA'99: Advances in Artificial Intelligence, Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence, Bologna, E. Lamma and P. Mello, Eds. Number 1792 in Lecture Notes in Artificial Intelligence, vol. 1792. Springer-Verlag, Berlin, Germany, 49-60.
62. SADRI, F., TONI, F., AND TORRONI, P. 2002. An abductive logic programming architecture for negotiating agents. In Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA), S. Greco and N. Leone, Eds. Lecture Notes in Computer Science, vol. 2424. Springer-Verlag, Berlin, Germany, 419-431.
63. SARTOR, G. 2005. Legal Reasoning: A Cognitive Approach to the Law. Springer, Berlin, Germany.
64. SATOH, K., INOUE, K., IWANUMA, K., AND SAKAMA, C. 2000. Speculative computation by abduction under incomplete communication environments. In Proceedings of the Fourth International Conference on Multi-Agent Systems, (Boston, MA). IEEE Computer Society Press, Los Alamitos, CA, 263-270.
65. SATOH, K. AND IWAYAMA, N. 1992. A query evaluation method for abductive logic programming. In Proceedings of the Joint International Conference and Symposium on Logic Programming, Washington, USA, K. Apt, Ed. MIT Press, Cambridge, MA, 671-685.
66. SHANAHAN, M. P. 2000. Reinventing Shakey. In Logic-based Artificial Intelligence, J. Minker, Ed. Kluwer Int. Series In Engineering And Computer Science, vol. 597. Kluwer, Dordrecht, The Netherlands, 233-253.
67. SICStus 2006. SICStus Prolog user manual, release 3.12.7. Available online at http://www. sics.se/isl/sicstus/.
68. SINGH, M. 1998. Agent communication language: Rethinking the principles. IEEE Comput, 31, 12, 40-47.
69. SOCS. 2002-2005. Societies Of ComputeeS (SOCS): A computational logic model for the description, analysis and verification of global and open societies of heterogeneous computees. IST-2001-32530. http://lia.deis.unibo.it/ research/socs/.
70. SOCS-PR. 2005. The SOCS protocol repository. Available online at http://edu59.deis.unibo. it:8079/SOCSProtocolsRepository/jsp/index.jsp.
71. SOCS-SI 2006. SOCS-SI home page. Available online at http://lia.deis.unibo.it/research/ socs_si/.
72. STUCKEY, P. 1995. Negation and constraint logic programming. Inform. Computat. 118, 1, 12-33.
73. VAN DER TORRE, L. W. N. and TAN, Y.-H. 1999. Diagnosis and decision making in normative reasoning. Artific. Intell. Law 7, 1, 51-67.
74. VAN HENTENRYCK, P. AND DEVILLE, Y. 1991. The Cardinality Operator: A new logical connective for constraint logic programming. In Logic Programming, Proceedings of the Eigth International Conference (Paris, France), K. Furukawa, Ed. Vol. 2. 745-759.
75. VAN HENTENRYCK, P., SARASWAT, V., AND DEVILLE, Y. 1993. Design, implementation, and evaluation of the constraint language cc(FD). Tech. rep. CS-93-02. DepartmentofComputer Sciences, Brown University, Providence, RI.
76. VAN NUFFELEN, B. AND DENECKER, M. 2000. Problem solving in ID-logic with aggregates. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (NMR'00, Breckenridge, CO). 1-9.
77. VISSER, W., HAVELUND, K., BRAT, G. P., AND PARK, S. 2000. Model checking programs. In Proceedings of the Fifteenth IEEE International Conference on Automated Software Engineering (ASE'00). IEEE Computer Society Press, Los Alamitos, CA, 3-12.
78. WOOLDRIDGE, M. 2002. Introduction to Multi-Agent Systems. John Wiley & Sons, New York, NY.
79. WOOLDRIDGE, M., HUGET, M.-P., FISHER, M., AND PARSONS, S. 2006. Model checking for multiagent systems: The MABLE language and its applications. Int. J. Artific. Intell. Tools 15, 2, 195-226.
80. WRIGHT, G. 1951. Deontic logic. Mind 60, 1-15.
81. XANTHAKOS, I. 2003. Semantic integration of information by abduction. Ph.D. dissertation. Imperial CollegeLondon,London,U.K. Available onlineathttp://www.doc.ic.ac.uk/∼ix98/PhD.zip.
82. YOLUM, P. AND SINGH, M. 2002. Flexible protocol specification and execution: Applying event calculus planning using commitments. In Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2002), Part II, C. Castelfranchi and W. Lewis Johnson, Eds. ACM Press, New York, NY, 527-534.