Titlebook: KI 2001: Advances in Artificial Intelligence; Joint German/Austria Franz Baader,Gerhard Brewka,Thomas Eiter Conference proceedings 2001 Spr

發(fā)誓放棄

Computational Game Theory and AIsolutions of classical game theory with an explicit emphasis on computational efficiency and scalability. The interest from the AI community arises from several sources, including models and algorithms for multi-agent systems, design of electronic commerce agents, and the study of compact representa

暖昧關(guān)系

Optimal Agent Sectionblem into “subproblems” and find an agent to solve each of the subproblems. Later, it may combine the results of these subproblems to solve the original problem. In this case, the agent is faced with the task of determining to which agents to assign the subproblems.We call this the . (ASP for short)

消散

Towards First-Order Temporal Resolutioncently been introduced by Hodkinson, Wolter and Zakharyaschev. While a finite Hilbert-like axiomatization of complete monodic first order temporal logic was developed by Wolter and Zakharyaschev, we propose a temporal resolutionbased proof system which reduces the satisfiability problem for ground e

審問,審訊

Approximating Most Specific Concepts in Description Logics with Existential Restrictionsses. For DLs that allow for existential restrictions or number restrictions, however, the msc need not exist unless one allows for cyclic concepts interpreted with the greatest fixed-point semantics. Since such concepts cannot be handled by current DL-systems, we propose to approximate the msc. We s