http://www.cnr.it/ontology/cnr/individuo/prodotto/ID223044
A Computationally Grounded Dynamic Logic of Agency, with an Application to Legal Actions (Contributo in atti di convegno)
- Type
- Label
- A Computationally Grounded Dynamic Logic of Agency, with an Application to Legal Actions (Contributo in atti di convegno) (literal)
- Anno
- 2012-01-01T00:00:00+01:00 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
- 10.1007/978-3-642-31570-1_12 (literal)
- Alternative label
Herzig, Andreas; de Lima, Tiago; Lorini, Emiliano; Troquard, Nicolas (2012)
A Computationally Grounded Dynamic Logic of Agency, with an Application to Legal Actions
in Deontic Logic in Computer Science, 11th International Conference, DEON 2012. Proceedings, Bergen, Norway, 16-18 July 2012
(literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- Herzig, Andreas; de Lima, Tiago; Lorini, Emiliano; Troquard, Nicolas (literal)
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#altreInformazioni
- PROGETTO: Logical Analysis of Socio-Technical Systems; DISCIPLINA DI RIFERIMENTO: AI, Robotics & Automatic Control; AREA DI VALUTAZIONE: 01 - Scienze matematiche e informatiche; ID_PUMA: /cnr.istc/2012-A2-003 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
- http://link.springer.com/chapter/10.1007%2F978-3-642-31570-1_12 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#volumeInCollana
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
- Note
- ISI Web of Science (WOS) (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
- CNR-ISTC, Trento (literal)
- Titolo
- A Computationally Grounded Dynamic Logic of Agency, with an Application to Legal Actions (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
- 978-3-642-31569-5 (literal)
- 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. (literal)
- Editore
- Prodotto di
- Autore CNR
- Insieme di parole chiave
Incoming links:
- Prodotto
- Autore CNR di
- Editore di
- Insieme di parole chiave di