Back to search

Institutional Repository of Vilnius University

Įrodymų išvedimo sudėtingumas teiginių laiko logikai /

Abstract

dc:description

The aim of this paper is to analyze and construct processes that automatically generate various size resource demanding predicate linear time logic (PLTL) formulas to reliably compare the efficiency of different sequent provers in PLTL. Finitary sequent calculi GLT (with a looping rule) and GIT (with an invariant rule) together with their derivation processes are analyzed. Later these processes are used to implement a sequent prover in Python that allows to measure different aspects of proof derivation such as: time consumption, used comparisons, the height of the proof tree, the number of rules used in derivation, the number of derivation loops, etc. Various size PLTL formulae examples are examined and two automatable structures (S, i, j) and (S, n, i, k) that generate difficult to prove sequents are introduced. Also, two resource demanding sequents SL1 and SL2 that were generated using genetic algorithm are presented and tested using an open-source sequent prover “pltlProver”.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2021

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Tupinis, Gvidas,
Contributors dc:contributor
  • Birštunas, Adomas

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
lit

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Tupinis, Gvidas,. Įrodymų išvedimo sudėtingumas teiginių laiko logikai /. Institutional Repository of Vilnius University, 2021. https://repository.vu.lt/VU:ELABAETD107116843&prefLang=en_US