On the Implementation of Global Abduction

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    Abstract

    Global Abduction (GA) is a recently proposed logical formalism for agent oriented programming which allows an agent to collect information about the world and update this in a nonmonotonic way when changes in the world are observed. A distinct feature of Global Abduction is that in case the agent needs to give up one plan, it may start a new one, or continue a suspended plan, while its beliefs learned about the world in the failed attempts persist. This paper describes an implementation of GA in the high-level language of Constraint Handling Rules (CHR). It appears to be a first attempt to a full implementation of GA, which also confirms CHR as a powerful meta-programming language for advanced reasoning. The construction gives rise to discussing important issues of the semantics and pragmatics of Global Abduction, leading to proposal for a specific procedural semantics and architecture that seem well-suited for real-time application.
    Original languageEnglish
    Title of host publicationComputational logic in Multi-Agent Systems : 7th Workshop on Computational Logic in Multi-Agent Systems, CLIMA-VIIHakodate, japan, May 2006Revised Selected and Invited papers
    EditorsKatsumi Inoue, Ken Satoh, Francesca Toni
    Number of pages16
    Volume4371
    PublisherKluwer Academic Publishers
    Publication date2007
    Pages226-245
    DOIs
    Publication statusPublished - 2007
    EventSeventh Workshop on Computational Logic in Multi-Agent Systems (CLIMA-VII) - Hakodate, Japan
    Duration: 8 May 20069 May 2006
    Conference number: 7

    Conference

    ConferenceSeventh Workshop on Computational Logic in Multi-Agent Systems (CLIMA-VII)
    Number7
    CountryJapan
    CityHakodate
    Period08/05/200609/05/2006
    SeriesLecture Notes in Computer Science
    Volume4371
    ISSN0302-9743

    Keywords

    • multi-agent systems
    • abduction
    • Constraint Handling Rules

    Cite this

    Christiansen, H. (2007). On the Implementation of Global Abduction. In K. Inoue, K. Satoh, & F. Toni (Eds.), Computational logic in Multi-Agent Systems: 7th Workshop on Computational Logic in Multi-Agent Systems, CLIMA-VIIHakodate, japan, May 2006Revised Selected and Invited papers (Vol. 4371, pp. 226-245). Kluwer Academic Publishers. Lecture Notes in Computer Science, Vol.. 4371 https://doi.org/10.1007/978-3-540-69619-3_13
    Christiansen, Henning. / On the Implementation of Global Abduction. Computational logic in Multi-Agent Systems: 7th Workshop on Computational Logic in Multi-Agent Systems, CLIMA-VIIHakodate, japan, May 2006Revised Selected and Invited papers. editor / Katsumi Inoue ; Ken Satoh ; Francesca Toni. Vol. 4371 Kluwer Academic Publishers, 2007. pp. 226-245 (Lecture Notes in Computer Science, Vol. 4371).
    @inproceedings{3919aba0b77211db974c000ea68e967b,
    title = "On the Implementation of Global Abduction",
    abstract = "Global Abduction (GA) is a recently proposed logical formalism for agent oriented programming which allows an agent to collect information about the world and update this in a nonmonotonic way when changes in the world are observed. A distinct feature of Global Abduction is that in case the agent needs to give up one plan, it may start a new one, or continue a suspended plan, while its beliefs learned about the world in the failed attempts persist. This paper describes an implementation of GA in the high-level language of Constraint Handling Rules (CHR). It appears to be a first attempt to a full implementation of GA, which also confirms CHR as a powerful meta-programming language for advanced reasoning. The construction gives rise to discussing important issues of the semantics and pragmatics of Global Abduction, leading to proposal for a specific procedural semantics and architecture that seem well-suited for real-time application.",
    keywords = "multi-agent systems, abduction, Constraint Handling Rules",
    author = "Henning Christiansen",
    year = "2007",
    doi = "10.1007/978-3-540-69619-3_13",
    language = "English",
    volume = "4371",
    pages = "226--245",
    editor = "Katsumi Inoue and Ken Satoh and Francesca Toni",
    booktitle = "Computational logic in Multi-Agent Systems",
    publisher = "Kluwer Academic Publishers",

    }

    Christiansen, H 2007, On the Implementation of Global Abduction. in K Inoue, K Satoh & F Toni (eds), Computational logic in Multi-Agent Systems: 7th Workshop on Computational Logic in Multi-Agent Systems, CLIMA-VIIHakodate, japan, May 2006Revised Selected and Invited papers. vol. 4371, Kluwer Academic Publishers, Lecture Notes in Computer Science, vol. 4371, pp. 226-245, Hakodate, Japan, 08/05/2006. https://doi.org/10.1007/978-3-540-69619-3_13

    On the Implementation of Global Abduction. / Christiansen, Henning.

    Computational logic in Multi-Agent Systems: 7th Workshop on Computational Logic in Multi-Agent Systems, CLIMA-VIIHakodate, japan, May 2006Revised Selected and Invited papers. ed. / Katsumi Inoue; Ken Satoh; Francesca Toni. Vol. 4371 Kluwer Academic Publishers, 2007. p. 226-245 (Lecture Notes in Computer Science, Vol. 4371).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    TY - GEN

    T1 - On the Implementation of Global Abduction

    AU - Christiansen, Henning

    PY - 2007

    Y1 - 2007

    N2 - Global Abduction (GA) is a recently proposed logical formalism for agent oriented programming which allows an agent to collect information about the world and update this in a nonmonotonic way when changes in the world are observed. A distinct feature of Global Abduction is that in case the agent needs to give up one plan, it may start a new one, or continue a suspended plan, while its beliefs learned about the world in the failed attempts persist. This paper describes an implementation of GA in the high-level language of Constraint Handling Rules (CHR). It appears to be a first attempt to a full implementation of GA, which also confirms CHR as a powerful meta-programming language for advanced reasoning. The construction gives rise to discussing important issues of the semantics and pragmatics of Global Abduction, leading to proposal for a specific procedural semantics and architecture that seem well-suited for real-time application.

    AB - Global Abduction (GA) is a recently proposed logical formalism for agent oriented programming which allows an agent to collect information about the world and update this in a nonmonotonic way when changes in the world are observed. A distinct feature of Global Abduction is that in case the agent needs to give up one plan, it may start a new one, or continue a suspended plan, while its beliefs learned about the world in the failed attempts persist. This paper describes an implementation of GA in the high-level language of Constraint Handling Rules (CHR). It appears to be a first attempt to a full implementation of GA, which also confirms CHR as a powerful meta-programming language for advanced reasoning. The construction gives rise to discussing important issues of the semantics and pragmatics of Global Abduction, leading to proposal for a specific procedural semantics and architecture that seem well-suited for real-time application.

    KW - multi-agent systems

    KW - abduction

    KW - Constraint Handling Rules

    U2 - 10.1007/978-3-540-69619-3_13

    DO - 10.1007/978-3-540-69619-3_13

    M3 - Article in proceedings

    VL - 4371

    SP - 226

    EP - 245

    BT - Computational logic in Multi-Agent Systems

    A2 - Inoue, Katsumi

    A2 - Satoh, Ken

    A2 - Toni, Francesca

    PB - Kluwer Academic Publishers

    ER -

    Christiansen H. On the Implementation of Global Abduction. In Inoue K, Satoh K, Toni F, editors, Computational logic in Multi-Agent Systems: 7th Workshop on Computational Logic in Multi-Agent Systems, CLIMA-VIIHakodate, japan, May 2006Revised Selected and Invited papers. Vol. 4371. Kluwer Academic Publishers. 2007. p. 226-245. (Lecture Notes in Computer Science, Vol. 4371). https://doi.org/10.1007/978-3-540-69619-3_13