Buss, Samuel R.; Kuznets, Roman (2009). The NP-Completeness of Reflected Fragments of Justification Logics. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings. Lecture Notes in Computer Science: Vol. 5407 (pp. 122-136). Heidelberg: Springer Verlag 10.1007/978-3-540-92687-0_9
![[img]](https://boris.unibe.ch/style/images/fileicons/text.png) |
Text
978-3-540-92687-0_9.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (447kB) |
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: |
Kuznets, Roman |
Series: |
Lecture Notes in Computer Science |
Publisher: |
Springer Verlag |
Language: |
English |
Submitter: |
Factscience Import |
Date Deposited: |
04 Oct 2013 15:23 |
Last Modified: |
23 May 2023 15:19 |
Publisher DOI: |
10.1007/978-3-540-92687-0_9 |
BORIS DOI: |
10.48350/37191 |
URI: |
https://boris.unibe.ch/id/eprint/37191 (FactScience: 207166) |
Actions (login required)
 |
Edit item |