-
Keywords: Philosophy; Normativity; Metaethics; Philosophy of Language;
Epistemology; Naturalism; Philosophy of the Social Sciences
-
Keywords: computer games; artificial intelligence; IJCAI; LSIR
-
The following document is a collection of slides and a short paper
arising from the meeting "A Day of Indian Logic" at the Institute for
Logic, Language, and Computation, University of Amsterdam, on November
2, 2009. The speakers at this workshop included Nicolas Clerbout
(Université Lille 3), Ma...
-
Proceedings of the Amsterdam Graduate Philosophy Conference 2009
Meaning and Truth
Theodora Achourioti, Edgar Andrade, Marc Staudacher
-
Proceedings of the Amsterdam Graduate Philosophy Conference
--- Truth, Meaning, and Normativity ---
María Inés Crespo, Dimitris Gakis, and Galit Weidman-Sassoon (eds.)
Abstract:
The 3rd Amsterdam Graduate Philosophy Conference on "Truth, Meaning,
and Normativity" was organised by the Departme...
-
These are the informal proceedings of the IJCAI Workshop on Social
Choice and Artificial Intelligence, held in Barcelona on 16 July 2011
as part of the workshop programme of the 22nd International Joint
Conference on Artificial Intelligence (IJCAI-2011). This volume
collects the 19 papers accepte...
-
We provide an overview of research on computational models of analogy-making.
The survey ranges from a fairly basic introduction to the topic of
computational analogy-making to reporting some quite recent advanced results
concerning the study of these systems, their properties and particularities...
-
The formal study of narratives goes back to the Russian structuralist
school, paradigmatically represented by the 1928 study Morphology of the Folktale by Vladimir Propp. Researchers in the field of computational narratology have developed the general Proppian methodology into various formal and ...
-
This is a personal view of how I became interested in epistemic logic,
and where I see the field heading today.
-
Solovay’s proof of the arithmetical completeness of the provability
logic GL proceeds by simulating a finite Kripke model inside the
theory of Peano Arithmetic (PA). In this article, a new perspective on
the proof of GL’s arithmetical completeness will be given. Instead of
simulating a Kripke str...
-
We identify the universal n-model of the negation-free fragment of the
intuitionistic propositional calculus IPC. We denote it by U*(n) and
show that it is isomorphic to a generated submodel of the universal
n-model of IPC, which is denoted by U(n). We show that this close
resemblance makes U*(n)...