Titlebook: KI 2018: Advances in Artificial Intelligence; 41st German Conferen Frank Trollmann,Anni-Yasmin Turhan Conference proceedings 2018 Springer

背叛者

HATCH

Fusing First-Order Knowledge Compilation and the Lifted Junction Tree Algorithm as well as first-order knowledge compilation (FOKC) based on weighted model counting. To handle multiple queries efficiently, the lifted junction tree algorithm (LJT) uses a first-order cluster representation of a model and LVE as a subroutine in its computations. For certain inputs, the implementa

demote

Systemic

支架

Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Itemsenvy-freeness and Pareto efficiency to groups of fixed sizes. . requires that no group envies another group. . requires that no group can be made better off without another group be made worse off. We study these new group properties from an axiomatic viewpoint. We thus propose new fairness taxonomi

要塞

GUMP

ligature

Maximizing Expected Impact in an Agent Reputation Networkt is general enough for the specification of a variety of stochastic multi-agent system (MAS) domains involving the impact of agents on each other’s reputations. Assuming that an agent must maintain a good enough reputation to survive in the system, a method for an agent to select optimal actions is

Inscrutable

涂掉