<div class="csl-bib-body">
<div class="csl-entry">Kiesl, B., & Suda, M. (2017). A Unifying Principle for Clause Elimination in First-Order Logic. In L. de Moura (Ed.), <i>Automated Deduction – CADE 26 : 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6–11, 2017, Proceedings</i>. Springer Cham. https://doi.org/10.1007/978-3-319-63046-5_17</div>
</div>
The final publication is available via <a href="https://doi.org/10.1007/978-3-319-63046-5_17" target="_blank">https://doi.org/10.1007/978-3-319-63046-5_17</a>.
-
dc.description.abstract
Preprocessing techniques for formulas in conjunctive normal form play an important role in first-order theorem proving. To speed up the proving process, these techniques simplify a formula without affecting its satisfiability or unsatisfiability. In this paper, we introduce the principle of implication modulo resolution, which allows us to lift several preprocessing techniques—in particular, several clause-elimination techniques—from the SAT-solving world to first-order logic. We analyze confluence properties of these new techniques and show how implication modulo resolution yields short soundness proofs for the existing first-order techniques of predicate elimination and blocked-clause elimination.
en
dc.description.sponsorship
Austrian Science Funds (FWF)
-
dc.description.sponsorship
National Science Foundation (NSF)
-
dc.description.sponsorship
ERC Starting Grant 2014
-
dc.language
English
-
dc.language.iso
en
-
dc.relation.ispartofseries
Lecture Notes in Computer Science
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.subject
theorem proving
en
dc.subject
first-order logic
en
dc.subject
sat
en
dc.subject
preprocessing
en
dc.subject
clause elimination
en
dc.subject
resolution
en
dc.title
A Unifying Principle for Clause Elimination in First-Order Logic
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.rights.license
Urheberrechtsschutz
de
dc.rights.license
In Copyright
en
dc.relation.isbn
9783319630465
-
dc.relation.doi
10.1007/978-3-319-63046-5
-
dc.relation.issn
0302-9743
-
dc.relation.grantno
W1255-N23
-
dc.relation.grantno
S11403-N23
-
dc.relation.grantno
S11409-N23
-
dc.relation.grantno
CCF-1618574
-
dc.relation.grantno
SYMCAR 639270
-
dc.rights.holder
Springer International Publishing AG 2017
-
dc.type.category
Full-Paper Contribution
-
dc.relation.eissn
1611-3349
-
tuw.booktitle
Automated Deduction – CADE 26 : 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6–11, 2017, Proceedings
-
tuw.container.volume
10395
-
tuw.book.ispartofseries
Lecture Notes in Computer Science
-
tuw.relation.publisher
Springer Cham
-
tuw.version
am
-
tuw.publication.orgunit
E192 - Institut für Informationssysteme
-
tuw.publisher.doi
10.1007/978-3-319-63046-5_17
-
dc.identifier.libraryid
AC11365110
-
dc.description.numberOfPages
18
-
dc.identifier.urn
urn:nbn:at:at-ubtuw:3-3321
-
dc.rights.identifier
Urheberrechtsschutz
de
dc.rights.identifier
In Copyright
en
tuw.event.name
CADE: International Conference on Automated Deduction 2017
-
tuw.event.startdate
06-08-2017
-
tuw.event.enddate
11-08-2017
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Göteborg
-
tuw.event.country
SE
-
tuw.event.presenter
Kiesl, Benjamin
-
item.languageiso639-1
en
-
item.openairetype
conference paper
-
item.grantfulltext
open
-
item.fulltext
with Fulltext
-
item.cerifentitytype
Publications
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
item.openaccessfulltext
Open Access
-
crisitem.author.dept
E192-04 - Forschungsbereich Formal Methods in Systems Engineering
-
crisitem.author.dept
E192-04 - Forschungsbereich Formal Methods in Systems Engineering
