资源分类
》 资源 》论文》Coco: Runtime Reasoning About Conflicting Commitments

Coco: Runtime Reasoning About Conflicting Commitments

2019-11-21 | |  53 |   38 |   0
Abstract To interact effectively, agents must enter into commitments. What should an agent do when these commitments conflict? We describe Coco, an approach for reasoning about which specific commitments apply to specific parties in light of general types of commitments, specific circumstances, and dominance relations among specific commitments. Coco adapts answer-set programming to identify a maximal set of nondominated commitments. It provides a modeling language and tool geared to support practical applications.

上一篇：Scalable Greedy Algorithms For Task/Resource Constrained Multi-Agent Stochastic Planning

下一篇：Verifying Existence of Resource-Bounded Coalition Uniform Strategies

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...