We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
In this paper we combine existing work in the area of social laws with a framework for reasoning about knowledge in multi-agent systems. The unifying framework in which this is do...
Wiebe van der Hoek, Mark Roberts, Michael Wooldrid...
—Commitments based on branching time logic are powerful representations for modeling multi-agent interactions. Current approaches into commitments have conceived these representa...
In this paper we apply a general account of practical reasoning to arguing about legal cases. In particular, we describe how the reasoning in one very well known property law case...
Katie Atkinson, Trevor J. M. Bench-Capon, Peter Mc...
Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considerin...