Name
Title | ||
|---|---|---|
A computationally grounded dynamic logic of agency, with an application to legal actions |
Abstract | ||
|---|---|---|
In this article, we propose a Dynamic Logic of Propositional Control DL-PC in which the concept of 'seeing to it that' (abbreviated stit) as studied by Belnap, Horty and others can be expressed; more precisely, we capture the concept of the so-called Chellas stit theory and the deliberatibe stit theory, as opposed to Belnap's original achievement stit. In this logic, the sentence 'group G sees to it that φ' is defined in terms of dynamic operators: it is paraphrased as 'group G is going to execute an action now such that whatever actions the agents outside G can execute at the same time, φ is true afterwards'. We also prove that the satisfiability problem is decidable. In the second part of the article we extend DL-PC with operators modeling normative concepts, resulting in a logic DL-PCLeg. In particular, we define the concepts of 'legally seeing to it that' and 'illegally seeing to it that'. We prove that the decidability result for DL-PC transfers to DL-PCLeg. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-31570-1_12 | DEON |
Keywords | Field | DocType |
logic dl-pcleg,dynamic logic,deliberatibe stit theory,group g,original achievement stit,decidability result,normative concept,stit theory,abbreviated stit,legal action,propositional control dl-pc,action,modal logic,agency | Computer science,Normative,Boolean satisfiability problem,Algorithm,Decidability,Artificial intelligence,Operator (computer programming),Modal logic,Dynamic logic (digital electronics),Sentence,Dynamic logic (modal logic) | Conference |
Citations | PageRank | References |
0 | 0.34 | 26 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreas Herzig | 1 | 655 | 48.55 |
| Tiago De Lima | 2 | 92 | 12.25 |
| Emiliano Lorini | 3 | 438 | 55.70 |
| Nicolas Troquard | 4 | 266 | 29.54 |