Sciweavers

579 search results - page 41 / 116
» Combined reasoning by automated cooperation
Sort
View
LPNMR
2011
Springer
12 years 11 months ago
Communicating ASP and the Polynomial Hierarchy
Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expre...
Kim Bauters, Steven Schockaert, Dirk Vermeir, Mart...
DEON
2010
Springer
14 years 1 months ago
Privacy Policies with Modal Logic: The Dynamic Turn
Abstract. Privacy policies are often defined in terms of permitted messages. Instead, in this paper we derive dynamically the permitted messages from static privacy policies defi...
Guillaume Aucher, Guido Boella, Leendert van der T...
KR
2010
Springer
14 years 1 months ago
From Preference Logics to Preference Languages, and Back
Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research...
Meghyn Bienvenu, Jérôme Lang, Nic Wil...
ICCBR
1999
Springer
14 years 29 days ago
Flexibly Interleaving Processes
We discuss several problems of analogy-driven proof plan construction which prevent a solution for more diæcult target problems or make a solution very expensive. Some of these pr...
Erica Melis, Carsten Ullrich
ICLP
2010
Springer
14 years 10 days ago
Communicating Answer Set Programs
Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving complex problems. Although mechanisms for represen...
Kim Bauters, Jeroen Janssen, Steven Schockaert, Di...