This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...
In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions...
Conditional random field (CRF) is a popular graphical model for sequence labeling. The flexibility of CRF poses significant computational challenges for training. Using existing o...
Agents’ pro attitudes such as goals, intentions, desires, wishes, and judgements of satisfactoriness play an important role in how agents act rationally. To provide a natural an...
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...