Logic Programming for Multiagent Planning with Negotiation

DOI10.1007/978-3-642-02846-5_13zbMath1251.68263OpenAlexW1490114956MaRDI QIDQ4649727

Enrico Pontelli, Chiaki Sakama, Tran Cao Son

Publication date: 13 November 2012

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02846-5_13

Mathematics Subject Classification ID

Logic programming (68N17) Agent technology and artificial intelligence (68T42)

Related Items (6)

A sequential model of bargaining in logic programming ⋮ Justifying answer sets using argumentation ⋮ Solving distributed constraint optimization problems using logic programming ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ Computing weighted solutions in ASP: representation-based method vs. search-based method ⋮ An action language for multi-agent domains

Uses Software

• XASP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Negotiation and cooperation in multi-agent environments
• Answer set programming and plan generation
• Extending and implementing the stable model semantics
• Agents that reason and negotiate by arguing
• Representing action and change by logic programs
• Domain-dependent knowledge in answer set planning
• A General Framework for Argumentation-Based Negotiation

This page was built for publication: Logic Programming for Multiagent Planning with Negotiation