10,924 research outputs found
Bounded Rationality and Heuristics in Humans and in Artificial Cognitive Systems
In this paper I will present an analysis of the impact that the notion of “bounded rationality”,
introduced by Herbert Simon in his book “Administrative Behavior”, produced in the
field of Artificial Intelligence (AI). In particular, by focusing on the field of Automated
Decision Making (ADM), I will show how the introduction of the cognitive dimension into
the study of choice of a rational (natural) agent, indirectly determined - in the AI field - the
development of a line of research aiming at the realisation of artificial systems whose decisions
are based on the adoption of powerful shortcut strategies (known as heuristics) based
on “satisficing” - i.e. non optimal - solutions to problem solving. I will show how the
“heuristic approach” to problem solving allowed, in AI, to face problems of combinatorial
complexity in real-life situations and still represents an important strategy for the design
and implementation of intelligent systems
Stone-type representations and dualities for varieties of bisemilattices
In this article we will focus our attention on the variety of distributive
bisemilattices and some linguistic expansions thereof: bounded, De Morgan, and
involutive bisemilattices. After extending Balbes' representation theorem to
bounded, De Morgan, and involutive bisemilattices, we make use of Hartonas-Dunn
duality and introduce the categories of 2spaces and 2spaces. The
categories of 2spaces and 2spaces will play with respect to the
categories of distributive bisemilattices and De Morgan bisemilattices,
respectively, a role analogous to the category of Stone spaces with respect to
the category of Boolean algebras. Actually, the aim of this work is to show
that these categories are, in fact, dually equivalent
A view of canonical extension
This is a short survey illustrating some of the essential aspects of the
theory of canonical extensions. In addition some topological results about
canonical extensions of lattices with additional operations in finitely
generated varieties are given. In particular, they are doubly algebraic
lattices and their interval topologies agree with their double Scott topologies
and make them Priestley topological algebras.Comment: 24 pages, 2 figures. Presented at the Eighth International Tbilisi
Symposium on Language, Logic and Computation Bakuriani, Georgia, September
21-25 200
Duality and canonical extensions for stably compact spaces
We construct a canonical extension for strong proximity lattices in order to
give an algebraic, point-free description of a finitary duality for stably
compact spaces. In this setting not only morphisms, but also objects may have
distinct pi- and sigma-extensions.Comment: 29 pages, 1 figur
Modal logics are coalgebraic
Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts. Coalgebraic semantics, on the other hand, provides a uniform and encompassing view on the large variety of specific logics used in particular domains. The coalgebraic approach is generic and compositional: tools and techniques simultaneously apply to a large class of application areas and can moreover be combined in a modular way. In particular, this facilitates a pick-and-choose approach to domain specific formalisms, applicable across the entire scope of application areas, leading to generic software tools that are easier to design, to implement, and to maintain. This paper substantiates the authors' firm belief that the systematic exploitation of the coalgebraic nature of modal logic will not only have impact on the field of modal logic itself but also lead to significant progress in a number of areas within computer science, such as knowledge representation and concurrency/mobility
Agency and fictional truth: a formal study on fiction-making
Fictional truth, or truth in fiction/pretense, has been the object of extended scrutiny among philosophers and logicians in recent decades. Comparatively little attention, however, has been paid to its inferential relationships with time and with certain deliberate and contingent human activities, namely, the creation of fictional works. The aim of the paper is to contribute to filling the gap. Toward this goal, a formal framework is outlined that is consistent with a variety of conceptions of fictional truth and based upon a specific formal treatment of time and agency, that of so-called stit logics. Moreover, a complete axiomatic theory of fiction-making TFM is defined, where fiction-making is understood as the exercise of agency and choice in time over what is fictionally true. The language L of TFM is an extension of the language of propositional logic, with the addition of temporal and modal operators. A distinctive feature of L with respect to other modal languages is a variety of operators having to do with fictional truth, including a \u2018fictionality\u2019 operator M (to be read as \u201cit is a fictional truth that\u201d). Some applications of TFM are outlined, and some interesting linguistic and inferential phenomena, which are not so easily dealt with in other frameworks, are accounted for
- …