Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
Our argumentation system, NAG, uses Bayesian networks in a user model and in a normative model to assemble and assess arguments which balance persuasiveness with normative correct...
Abstract. Domain ontologies very rarely model verbs as relations holding between concepts. However, the role of the verb as a central connecting element between concepts is undenia...
In order to obtain semantic interoperability in open MultiAgent Systems, agents need to agree on the basis of different ontologies. In this paper we formally define mapping as cor...
Reasoning in legal and social domains appears not to be well dealt with by deductive approaches. This is because such reasoning is open-endedly defeasible, and because the various ...