Dempsterās rule for combining two belief functions assumes the independence of the sources of information. If this assumption is questionable, I suggest to use the least speciļ¬...
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
Modern information retrieval systems need the capability to reason about the knowledge conveyed by text bases. In this paper a methodology to automatically create ontologies and cl...
PHOSPHORUS is an agent matchmaking service that exploits domain ontologies, description logic, and a highly declarative language to reason about task-related agent capabilities. P...