Tableau Systems for Deontic Action Logics Based on Finite Boolean Algebras, and Their Complexity | ||
| dc.conicet.organizacion | Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Computación | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba | |
| dc.contributor.author | Castro, Pablo Francisco | |
| dc.date.issued | 2017-04 | |
| dc.description.abstract | We introduce a family of tableau calculi for deontic action logics based on finite boolean algebras (or DAL for short), these logics provide deontic operators (e.g., obligation, permission, prohibition) which are applied to a finite number of actions (the vocabulary of the logic); furthermore, in these formalisms, actions can be combined by means of boolean operators, this provides an expressive algebra of actions. We define a tableau calculus for the basic logic and then we extend this calculus to cope with extant variations of this formalism; we prove the soundness and completeness of these proof systems. In addition, we investigate the computational complexity of the satisfiability problem for DAL and its extensions; we show this problem is NP-complete when the number of actions considered is fixed, and it is Σ2p-Hard (in Stockmeyer’s polynomial hierarchy) when the number of actions is taken as an extra parameter. The tableau systems introduced here can be implemented in PSPACE, this seems reasonable taking into consideration the computational complexity of the logics. | es |
| dc.description.fil | Fil: Castro, Pablo Francisco. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba; Argentina | |
| dc.format | application/pdf | es |
| dc.identifier.citation | Castro, Pablo Francisco; Tableau Systems for Deontic Action Logics Based on Finite Boolean Algebras, and Their Complexity; Springer; Studia Logica; 105; 2; 4-2017; 229-251 | es |
| dc.identifier.institucional | CONICET | |
| dc.identifier.issn | 0039-3215 | es |
| dc.identifier.repo | CONICET Digital | |
| dc.identifier.uri | http://hdl.handle.net/11336/132920 | |
| dc.journal.number | 2 | es |
| dc.journal.pagination | 229-251 | es |
| dc.journal.pais | Polonia | es |
| dc.journal.title | Studia Logica | es |
| dc.journal.volume | 105 | es |
| dc.language.iso | eng | es |
| dc.publisher | Springer | es |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/http://link.springer.com/article/10.1007/s11225-016-9688-6 | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1007/s11225-016-9688-6 | |
| dc.rights | info:eu-repo/semantics/openAccess | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | * |
| dc.subject | COMPUTATION COMPLEXITY | es |
| dc.subject | DEONTIC ACTION LOGICS | es |
| dc.subject | SAT | es |
| dc.subject | TABLEAU SYSTEMS | es |
| dc.subject.classification | Ciencias de la Computación | es |
| dc.subject.classification | Ciencias de la Computación e Información | es |
| dc.subject.classification | CIENCIAS NATURALES Y EXACTAS | es |
| dc.title | Tableau Systems for Deontic Action Logics Based on Finite Boolean Algebras, and Their Complexity | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
Archivos
Bloque original
Cargando...
- Nombre:
- CONICET_Digital_Nro.bafbd363-b3c7-4cc6-93b9-2b852777faf1_A.pdf
- Tamaño:
- 397.19 KB
- Formato:
- Adobe Portable Document Format