DC Element
Wert
Sprache
dc.contributor.author
Ciabattoni, Agata
-
dc.contributor.author
Tesi, Matteo
-
dc.contributor.editor
Benzmüller, Christoph
-
dc.contributor.editor
Heule, Marijn
-
dc.contributor.editor
Schmidt, Renate
-
dc.date.accessioned
2024-08-14T13:49:22Z
-
dc.date.available
2024-08-14T13:49:22Z
-
dc.date.issued
2024
-
dc.identifier.citation
<div class="csl-bib-body"> <div class="csl-entry">Ciabattoni, A., &#38; Tesi, M. (2024). Sequents vs Hypersequents for Aqvist Systems. In C. Benzmüller, M. Heule, &#38; R. Schmidt (Eds.), <i>Automated Reasoning: 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings, Part II</i> (pp. 176–195). Springer. https://doi.org/10.1007/978-3-031-63501-4_10</div> </div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/199690
-
dc.description.abstract
Enhancing cut-free expressiveness through minimal structural additions to sequent calculus is a natural step. We focus on ˚Aqvist’s system F with cautious monotonicity (CM), a deontic logic extension of S5, for which we define a sequent calculus employing (semi) analytic cuts.The transition to hypersequents is key to develop modular and cut-free calculi for F + (CM) and G, also supporting countermodel construction.
en
dc.description.sponsorship
FWF - Österr. Wissenschaftsfonds
-
dc.language.iso
en
-
dc.relation.ispartofseries
Lecture Notes in Computer Science
-
dc.rights.uri
http://creativecommons.org/licenses/by/4.0/
-
dc.subject
Deontic Logic
en
dc.subject
Hypersequent calculi
en
dc.subject
Cut-reduction
en
dc.title
Sequents vs Hypersequents for Aqvist Systems
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.rights.license
Creative Commons Namensnennung 4.0 International
de
dc.rights.license
Creative Commons Attribution 4.0 International
en
dc.relation.isbn
978-3-031-63501-4
-
dc.description.startpage
176
-
dc.description.endpage
195
-
dc.relation.grantno
I 6372
-
dc.rights.holder
© The Author(s) 2024
-
dc.type.category
Full-Paper Contribution
-
tuw.booktitle
Automated Reasoning: 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings, Part II
-
tuw.container.volume
14740
-
tuw.peerreviewed
true
-
tuw.relation.publisher
Springer
-
tuw.relation.publisherplace
Cham
-
tuw.project.title
Logical methods for Deontic Explanations
-
tuw.researchTopic.id
C5
-
tuw.researchTopic.name
Computer Science Foundations
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-05 - Forschungsbereich Theory and Logic
-
tuw.publication.orgunit
E056-23 - Fachbereich Innovative Combinations and Applications of AI and ML (iCAIML)
-
tuw.publisher.doi
10.1007/978-3-031-63501-4_10
-
dc.identifier.libraryid
AC17346624
-
dc.description.numberOfPages
20
-
dc.rights.identifier
CC BY 4.0
de
dc.rights.identifier
CC BY 4.0
en
tuw.editor.orcid
0000-0002-3392-3093
-
tuw.event.name
Automated Reasoning - 12th International Joint Conference, IJCAR 2024
en
tuw.event.startdate
03-07-2024
-
tuw.event.enddate
06-07-2024
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Nancy
-
tuw.event.country
FR
-
tuw.event.presenter
Tesi, Matteo
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.languageiso639-1
en
-
item.openairetype
conference paper
-
item.grantfulltext
open
-
item.fulltext
with Fulltext
-
item.cerifentitytype
Publications
-
item.mimetype
application/pdf
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
item.openaccessfulltext
Open Access
-
crisitem.author.dept
E192-05 - Forschungsbereich Theory and Logic
-
crisitem.author.dept
E192-05 - Forschungsbereich Theory and Logic
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.project.funder
FWF - Österr. Wissenschaftsfonds
-
crisitem.project.grantno
I 6372
-
Enthalten in den Sammlungen:
Conference Paper
Miniaturbild
Volltext (Version of Record (published version))
Adobe PDF
(366.15 kB)
Artikel
Open Access CC BY 4.0
Zur Kurzanzeige

Seiten Aufrufe

173
aufgerufen am 15.08.2024

Download(s)

59
aufgerufen am 15.08.2024

Google ScholarTM

Check