Output details
11 - Computer Science and Informatics
Swansea University
Return to search
Output 0 of 0 in the submission
Article title
Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution
Type
D - Journal article
Title of journal
Journal of Automated Reasoning
Article number
-
Volume number
n/a
Issue number
-
First page of article
n/a
ISSN of journal
0168-7433
Year of publication
2013
URL
-
Number of additional authors
1
Additional information
<22> The classes UC and SLUR considered were introduced independently in the 1990s. Here we show that they are actually identical and, indeed, in a generalised model. For the fields of knowledge compilation and SAT solving this unexpected result should become a standard reference. The SOFSEM 2013 conference version won the Best Paper award out of 37 accepted papers (http://www.sofsem.cz/sofsem13/index.php?page=presentations).
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Theoretical Computer Science
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
