Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
The paper proposes a formal analysis of the ascriptive view of norms as resulting from pulling together Anderson's reductionist approach, the analysis of counts-as, and a nove...
Abstract. In this paper we investigate how to model legal abrogation and annulment in Defeasible Logic. We examine some options that embed in this setting, and similar rule-based s...
The paper presents experimental comparison of several resolution strategies for reasoning in Fuzzy Description Logic based on Fuzzy Predicate Logic with evaluated syntax. Resoluti...
Bayesian networks are formal graphical languages for representation and communication of decision scenarios requiring reasoning under uncertainty. We will analyze Bayesian network...