We present and implement an infrastructure for automating the negotiation of business contracts. Underlying our system is a declarative language for both (1) fully-specified, exe...
Daniel M. Reeves, Michael P. Wellman, Benjamin N. ...
Rule induction from examples is a machine learning technique that finds rules of the form condition → class, where condition and class are logic expressions of the form variable...
We present a framework for the automatic recognition of complex multi-agent events in settings where structure is imposed by rules that agents must follow while performing activit...
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical for...