All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
Abstract. Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology i...
Nick Bassiliades, Grigoris Antoniou, Ioannis P. Vl...
Abstract. In this paper, we consider the process algebra ACPL, which models the basics of agent communication. This algebra combines the informationprocessing aspects of Concurrent...
Rogier M. van Eijk, Frank S. de Boer, Wiebe van de...
Coalgebras provide a uniform framework for the semantics of a large class of (mostly non-normal) modal logics, including e.g. monotone modal logic, probabilistic and graded modal l...
The paper presents a comparative study of semantic and lexical relations defined and adopted in WordNet and EuroWordNet. This document describes the experimental observations achi...
Maria Teresa Pazienza, Armando Stellato, Alexandra...