One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
It is generally accepted that knowledge based systems would be smarter and more robust if they can manage inconsistent, incomplete or imprecise knowledge. This paper is about a fo...
In this paper we present s1, a family of logics that is useful to disprove propositional formulas by means of an anytime approximation process. The systems follows the paradigm of...
The aim of this paper is to investigate the expressibility of classical propositional monomodal logics. To this end, a notion of embedding of one logic into another is introduced,...