We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner. We use the sto...
Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby W...
We consider the problem of translating first-order answer set programs with aggregates into first-order sentences with the same type of aggregates. In particular, we show that, ...
We present a powerful new account of multi-agent knowledge in the situation calculus and an automated reasoning procedure for knowledge queries. Existing accounts of epistemic rea...
Symmetry breaking has been a hot topic of research in the past years, leading to many theoretical developments as well as strong scaling strategies for dealing with hard applicati...
RCC8 is a popular fragment of the region connection calculus, in which qualitative spatial relations between regions, such as adjacency, overlap and parthood, can be expressed. Wh...
Recent work introduced Generalized First Order Decision Diagrams (GFODD) as a knowledge representation that is useful in mechanizing decision theoretic planning in relational doma...
g the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory Hannes Strass Computer Science Institute Leipzig University, Germany Johannes Pe...
for solving reasoning problems in abstract argumentation – A survey Günther Charwat a , Wolfgang Dvoˇrák b , Sarah A. Gaggl c , Johannes P. Wallner a , Stefan Woltran a,∗ a ...