Relaxed Weighted Path Order in Theorem Proving

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Relaxed Weighted Path Order in Theorem Proving

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Relaxed Weighted Path Order in Theorem Proving

Popis výsledku anglicky

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.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

R - Projekt Ramcoveho programu EK

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Mathematics in Computer Science

ISSN

1661-8270

e-ISSN

1661-8289

Svazek periodika

14

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

CH - Švýcarská konfederace

Počet stran výsledku

14

Strana od-do

657-670

Kód UT WoS článku

000522569800001

EID výsledku v databázi Scopus

2-s2.0-85083103430