Loop-check - Open Access .click

Lithuanian Mathematical Journal, 2006
We introduce a new sequent calculus for KD 45 logic. A loop-check technique is used to determine whether a sequent derivable or not. We concentrate ourselves on the efficiency of the loop-check technique used. The efficiency is obtained by making the loop-check to act locally (then we need to check only one or two current sequents), instead of a global
A. Birštunas
openaire +2 more sources

An extended variant of atoms loop check for positive logic programs

New Generation Computing, 1997
The Equality check and the Subsumption check are weakly sound, but are not complete even for function-free logic programs. Although the OverSize (OS) check is complete for positive logic programs, it is too general in the sense that it prunes SLD-derivations merely based on the depth-bound of repeated predicate symbols and the size of atoms, regardless
Yi-Dong Shen
openaire +2 more sources

Efficient loop-check for backward proof search in some non-classical propositional logics

International Conference on Theorem Proving with Analytic Tableaux and Related Methods, 1996
We consider the modal logics KT and S4, the tense logic Kt, and the fragment IPC(∧,→) of intuitionistic logic.
Alain Heuerding, Michael Seyfried, Heinrich Zimmermann +2 more
openaire +2 more sources

mathematics
sequent calculus
computer science

physics
loop graph theory
combinatorics

algorithm
programming language
geometry