Relaxed Weighted Path Order in Theorem Proving
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F20%3A00346140" target="_blank" >RIV/68407700:21730/20:00346140 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s11786-020-00474-0" target="_blank" >https://doi.org/10.1007/s11786-020-00474-0</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11786-020-00474-0" target="_blank" >10.1007/s11786-020-00474-0</a>
Alternative languages
Result language
angličtina
Original language name
Relaxed Weighted Path Order in Theorem Proving
Original language description
We propose an extension of the automated theorem prover E by the weighted path ordering (WPO). WPO is theoretically stronger than all the orderings used in E Prover, however its parametrization is more involved than those normally used in automated reasoning. In particular, it depends on a term algebra. We integrate the ordering in E Prover and perform an evaluation on the standard theorem proving benchmarks. The ordering is complementary to the ones used in E prover so far. Furthermore, first-time presented here, we propose a relaxed variant of the weighted path order as an approximation of the standard WPO definition. A theorem prover strategy with a relaxed order can be incomplete, which is, however, not an issue as completeness can be easily regained by switching to a complete strategy. We show that the relaxed weighted path order can have a huge impact on an improvement of a theorem prover strategy.
Czech name
—
Czech description
—
Classification
Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
R - Projekt Ramcoveho programu EK
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Mathematics in Computer Science
ISSN
1661-8270
e-ISSN
1661-8289
Volume of the periodical
14
Issue of the periodical within the volume
3
Country of publishing house
CH - SWITZERLAND
Number of pages
14
Pages from-to
657-670
UT code for WoS article
000522569800001
EID of the result in the Scopus database
2-s2.0-85083103430