The computational process is based on the activity linking mathematical equations to a materialized physical world. It consumes energy which lower limit is defined by the set of ...
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...
Defeasible logic is an efficient non-monotonic logic that is defined only proof-theoretically. It has potential application in some legal domains. We present here an argumentatio...
Recent years have seen an increasing interest of multiagent system research in employing the theory of argumentation for the development of communication protocols. While signific...
Michael Rovatsos, Iyad Rahwan, Felix A. Fischer, G...
Abstract. The identification of consistent sets of arguments is one of the most important concerns in the development of computational models of argument. Such extensions drive the...