<div class="csl-bib-body">
<div class="csl-entry">Rawson, M. (2022). <i>Linear Refutation and Clause Splitting</i>. EasyChair Preprints.</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/154430
-
dc.description.abstract
Linear resolution is one of the ancient methods for first-order theorem proving. We extend linear resolution with clause splitting, producing subgoals dispatched independently. An incremental SAT solver keeps track of refutations and thus provides a “lemma” mechanism. We describe some implementation considerations, present some initial experimental results, and discuss future directions for this approach.
en
dc.language.iso
en
-
dc.subject
Boolean satisfiability
en
dc.subject
clause splitting
en
dc.subject
linear resolution
en
dc.title
Linear Refutation and Clause Splitting
-
dc.type
Preprint
en
dc.type
Preprint
de
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.linking
https://easychair.org/publications/preprint/wPzVq
-
tuw.publication.orgunit
E192-04 - Forschungsbereich Formal Methods in Systems Engineering
-
dc.description.numberOfPages
10
-
tuw.author.orcid
0000-0001-7834-1567
-
tuw.publisher.server
EasyChair Preprints
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.openairetype
Preprint
-
item.openairetype
Preprint
-
item.grantfulltext
none
-
item.cerifentitytype
Publications
-
item.cerifentitytype
Publications
-
item.languageiso639-1
en
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cf
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cf
-
item.fulltext
no Fulltext
-
crisitem.author.dept
E192-04 - Forschungsbereich Formal Methods in Systems Engineering