Decidability for Justification Logics Revisited

Bucheli, Samuel; Kuznets, Roman; Studer, Thomas (2013). Decidability for Justification Logics Revisited. In: Logic, language, and computation. Lecture Notes in Computer Science: Vol. 7758 (pp. 166-181). Berlin, Heidelberg: Springer Berlin Heidelberg 10.1007/978-3-642-36976-6_12

[img] Text
chp%3A10.1007%2F978-3-642-36976-6_12.pdf_auth66=1397814091_9dbf241a5df61d3f04ece01d19050a6d&ext=.pdf - Published Version
Restricted to registered users only
Available under License Publisher holds Copyright.

Download (253kB) | Request a copy

Item Type: Book Section (Book Chapter)
Division/Institute: 08 Faculty of Science > Institute of Computer Science (INF) > Logic and Theory Group (LTG)
08 Faculty of Science > Institute of Computer Science (INF)
UniBE Contributor: Bucheli, Samuel; Kuznets, Roman and Studer, Thomas
Subjects: 000 Computer science, knowledge & systems
500 Science > 510 Mathematics
ISBN: 978-3-642-36975-9
Series: Lecture Notes in Computer Science
Publisher: Springer Berlin Heidelberg
Language: English
Submitter: Florian Ranzi
Date Deposited: 16 Apr 2014 11:50
Last Modified: 18 Dec 2014 00:50
Publisher DOI: 10.1007/978-3-642-36976-6_12
Uncontrolled Keywords: Justification logic, dedidability, filtration
BORIS DOI: 10.7892/boris.45209

Actions (login required)

Edit item Edit item
Provide Feedback