Relevant logic programming
Copyright policy )Relevant logic programming
Several authors suggested extension of Horn clause programming using bottom-up proof search in Gentzen-type systems for intuitionistic logic with suitable restriction of the language. The author describes a similar program based on the relevance logic LR\(^ +\) without negation and distributivity axiom. Language is restricted to banish negative occurrences of disjunction. For this fragment, relevance logic R is conservative over RL\(^ +\) as the author conjectured. This is Corollary 1 in the reviewer's paper [Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 32, 90-97 (1973; Zbl 0374.02017)] .
- Australian National University Australia
Mechanization of proofs and logical operations, Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics), Cut-elimination and normal-form theorems, Logic programming, relevance logic
Mechanization of proofs and logical operations, Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics), Cut-elimination and normal-form theorems, Logic programming, relevance logic
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!