View in EDS PDF Full Text

An Investigation of Multi-Agent Planning in CLP.

Saved in:
Bibliographic Details
Title: An Investigation of Multi-Agent Planning in CLP.
Authors: Dovier, Agostino1, Formisano, Andrea2, Pontelli, Enrico3
Source: Fundamenta Informaticae. 2011, Vol. 105 Issue 1-2, p79-103. 25p.
Subjects: Multiagent systems, Logic programming languages, Constraint satisfaction, Intelligent agents, Programming languages, MAP (Computer program language)
Abstract: This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning problems in the presence of multiple interacting agents. The paper develops a novel constraint-based action language, ℬMAP, that enables the declarative description of large classes of multi-agent and multi-valued domains. ℬMAP supports several complex features, including combined effects of concurrent and interacting actions, concurrency control, and delayed effects. The paper presents a mapping of ℬMAP theories to CLP and it demonstrates the effectiveness of an implementation in SICStus Prolog on several benchmark problems. The effort is an evolution of previous research on using CLP for single-agent domains, demonstrating the flexibility of CLP technology to handle the more complex issues of multi-agency and concurrency. [ABSTRACT FROM AUTHOR]
Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 57854805
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: An Investigation of Multi-Agent Planning in CLP.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Dovier%2C+Agostino%22">Dovier, Agostino</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Formisano%2C+Andrea%22">Formisano, Andrea</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Pontelli%2C+Enrico%22">Pontelli, Enrico</searchLink><relatesTo>3</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Fundamenta+Informaticae%22">Fundamenta Informaticae</searchLink>. 2011, Vol. 105 Issue 1-2, p79-103. 25p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Multiagent+systems%22">Multiagent systems</searchLink><br /><searchLink fieldCode="DE" term="%22Logic+programming+languages%22">Logic programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Constraint+satisfaction%22">Constraint satisfaction</searchLink><br /><searchLink fieldCode="DE" term="%22Intelligent+agents%22">Intelligent agents</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22MAP+%28Computer+program+language%29%22">MAP (Computer program language)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning problems in the presence of multiple interacting agents. The paper develops a novel constraint-based action language, ℬMAP, that enables the declarative description of large classes of multi-agent and multi-valued domains. ℬMAP supports several complex features, including combined effects of concurrent and interacting actions, concurrency control, and delayed effects. The paper presents a mapping of ℬMAP theories to CLP and it demonstrates the effectiveness of an implementation in SICStus Prolog on several benchmark problems. The effort is an evolution of previous research on using CLP for single-agent domains, demonstrating the flexibility of CLP technology to handle the more complex issues of multi-agency and concurrency. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=57854805
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 25
        StartPage: 79
    Subjects:
      – SubjectFull: Multiagent systems
        Type: general
      – SubjectFull: Logic programming languages
        Type: general
      – SubjectFull: Constraint satisfaction
        Type: general
      – SubjectFull: Intelligent agents
        Type: general
      – SubjectFull: Programming languages
        Type: general
      – SubjectFull: MAP (Computer program language)
        Type: general
    Titles:
      – TitleFull: An Investigation of Multi-Agent Planning in CLP.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Dovier, Agostino
      – PersonEntity:
          Name:
            NameFull: Formisano, Andrea
      – PersonEntity:
          Name:
            NameFull: Pontelli, Enrico
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 01
              Text: 2011
              Type: published
              Y: 2011
          Identifiers:
            – Type: issn-print
              Value: 01692968
          Numbering:
            – Type: volume
              Value: 105
            – Type: issue
              Value: 1-2
          Titles:
            – TitleFull: Fundamenta Informaticae
              Type: main
ResultId 1