Two loop detection mechanisms: a comparison
From MaRDI portal
Recommendations
- Detecting Loops During Proof Search in Propositional Affine Logic
- scientific article; zbMATH DE number 517070
- An analysis of loop checking mechanisms for logic programs
- Efficient loop-check for backward proof search in some non-classical propositional logics
- scientific article; zbMATH DE number 4182856
Cites work
- A new constructive logic: classic logic
- A resolution theorem prover for intuitionistic logic
- An Intuitionistic Predicate Logic Theorem Prover
- Contraction-free sequent calculi for intuitionistic logic
- Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
- Efficient loop-check for backward proof search in some non-classical propositional logics
- scientific article; zbMATH DE number 1348467 (Why is no real title available?)
- scientific article; zbMATH DE number 512976 (Why is no real title available?)
- scientific article; zbMATH DE number 2079018 (Why is no real title available?)
Cited in
(9)- Consistency of two detection techniques using single measurement of data
- Goal-oriented proof-search in natural deduction for intuitionistic propositional logic
- Proof theory for positive logic with weak negation
- A coinductive approach to proof search through typed lambda-calculi
- Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models
- A unified procedure for provability and counter-model generation in minimal implicational logic
- Intuitionistic Decision Procedures Since Gentzen
- A new rule for LTL tableaux
- Detecting Loops During Proof Search in Propositional Affine Logic
This page was built for publication: Two loop detection mechanisms: a comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4610326)
