2920 search results - page 163 / 584 » Finite information logic |
198
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know...
273
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Qualification has been recently introduced as a generalization of uncertainty in the field of Logic Programming. In this paper we investigate a more expressive language f...
169
click to vote
SUM
2009
Springer
15 years 11 months ago
2009
Springer
We propose a framework to compute the utility of an agreement w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formula...
152
click to vote
AUSAI
1999
Springer
15 years 11 months ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
188
click to vote
ECAI
2010
Springer
15 years 6 months ago
2010
Springer
We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}] expressing that the coalition of all agents satisfying (x) can ac...