Assistant Professor Martin Mose Bentzen, DTU Management will give a talk at DTU Compute on
 
The Principle of Double Effect Applied to Ethical Dilemmas of Social Robots


The introduction of social robots into society will require that they follow ethical principles which go beyond consequentialism.
In this paper, I show how to apply the principle of double effect to solve an ethical dilemma involving robots studied by Alan Winfield and colleagues.
The principle of double effect states conditions for ethically acceptable behavior when there are both positive and negative consequences of an action.
I propose a formal semantics with actions, causes, intentions, and utilities based upon the work of Judea Pearl, John Horty and others. With this formal semantics,
the question of whether an action is permitted according to the principle of double effect is reduced to deciding whether a certain formula is true or otherwise.
 
When: October 12 at 10:30
 
Where: Building 303, room 026 – Technical University of Denmark (DTU)
 
Host: Associate Professor Thomas Bolander
 

​

The first CADILLAC workshop will take place in Copenhagen at the cinema of Christiania, Byens Lys, 23-25 May 2016. Details can be found at the workshop home page:

https://cadillac.compute.dtu.dk

The CADILLAC workshop series will continue the Modality and Modalities workshop series (http://modalityandmodalities.weebly.com), but will extend its scope beyond modal logic, to cover applications of logical methods in philosophy, linguistics and cognitive science. The CADILLAC workshops will be organised by the CADILLAC network (http://cadillac-dk.weebly.com). This first edition is organised by Martin Mose Bentzen, Nina Gierasimczuk and Thomas Bolander.

It is the first scientific conference to take place in Christiania, and it will feature a Science and Cocktails talk (http://www.scienceandcocktails.org) by Rineke Verbrugge. The third day of the conference is a special theme day on Formal Models of Social Phenomena.

We wish to continue the tradition from the Modality and Modalities workshops, meaning that one of the goals of the workshop is to serve as a gathering of the local researchers in the CADILLAC areas: Dynamics, Interaction, Logic, Language and Computation. Everybody is very welcome to attend the workshop, and it is free of charge. Please consult the workshop web page for details on how to register.

https://cadillac.compute.dtu.dk

Friday 15 January DTU Compute will host two talks on algorithmic and logical aspects of cognition, followed by beer and snacks...

Time and place: Room S10, DTU meeting centre, building 101, 13.00-15.15 + drinks afterwards.
Host: Thomas Bolander

Schedule:

13.00-14.00 Iris van de Pol, PhD student, ILLC, University of Amsterdam. Complexity of Theory of Mind.
14.15-15.15 Jakub Szymanik, associate professor, ILLC, University of Amsterdam. Complexity of turn-based games.

Abstracts

Iris van de Pol. Complexity of Theory of Mind

In this talk I will discuss the complexity of theory of mind, which is the cognitive phenomenon that people attribute mental states to each other, like beliefs, desires, and intentions, and use these to predict or explain each other’s behavior. I present a computational-level model of theory of mind—based on dynamic epistemic logic—and analyze its (parameterized) complexity. In particular I show that the model is PSPACE-complete and that the modal depth of a formula does not influence its complexity. 
This talk is based on my master’s thesis. For a pdf, see: http://goo.gl/21FG2G.

--

Jakub Szymanik. Complexity of turn-based games

Inspired by the logical analysis of backward induction and cognitive science experiments, we investigate the computational complexity of the reasoning in extensive form dynamic games. We formalize the computational complexity of a general decision problem the players face, assuming common knowledge of rationality. We show that such defined problem is PTIME-complete.  Moreover, we provide a more refined analysis of the complexity of particular game trials which takes into account alternation type of the game and pay-off distribution. We conclude with some mathematical and cognitive open problems.

--

Please sign up for the talk at latest on 13 January, so I know how much beer and snacks to buy.

All are welcome! (Please distribute this email to any others you think might be interested). 
 
Best regards,

     Thomas Bolander

We are please to announce the following CADILLAC talk, which will take place at Roskilde University (RUC) on September 8th, 15.00-16.30 in Room 43.2-02 in Building 43.
Speaker: Petrucio Viana (Institute of Mathematics and Statistics, Federal Fluminense University, Brazil) 

Title: Graph calculus for proving equations and inclusions true on allegories

Abstract: 
Traditionally, formulas are written on a single line. S. Curtis and G. Lowe suggested a more visually appealing alternative for the case of binary relations: using graphs for expressing properties and reasoning about relations in a natural way. We extended their approach to diagrams that are sets of graphs. 

More specifically, in this setting, diagrams corresponds to sentences and transformations on graphs diagrams correspond to inference rules, that can be used to infer a diagram from a set of diagrams taken as hypothesis. The basic intuitions are quite simple, leading to playful and powerful systems. Our system fits very well as a tool for perform inferences on algebras of binary relations, but we developed it to treat positive, negative, and intuitionistic information, ranging from the geometric fragment to the whole of first order logic on binary relations. 

In this talk I summarize these achievements, presenting some on going work on extending the previous systems to deal with the equations and containments of the distributive, division, and power allegories, being tabular or not. Given the connection between classical modal logics and algebras of relations developed by E. Orlowska and her collaborators, our graphical system may be also explored as a tool for perform inferences in modal logic.

It is a great pleasure to be able to announce that the Algolog (Algorithms, Logic and Graphs) section of DTU Compute at the Technical University of Denmark (DTU) has employed two new magnificent logicians:

• Nina Gierasimczuk (http://www.ninagierasimczuk.com) is employed as assistant professor from 1 January 2015. 

• Antti Kuusisto (http://www.sis.uta.fi/~ak75987/) is employed as postdoc from 1 September 2015 to 31 August 2017. Antti is funded by the (highly competitive) HC Ørsted Postdoc programme at DTU, co-funded by Marie Curie Actions.

We look very much forward to welcome these two excellent people to the CADILLAC/Copenhagen logic community. Please keep them in mind for your future logic-related activities in "the greater Copenhagen area" (and in general!).

Best,

   Thomas Bolander