A Decision Algorithm for Stratified Context Unification
Copyright policy )A Decision Algorithm for Stratified Context Unification
The main result presented in this paper is the following: stratified context unification is decidable. As a consequence, satisfiability of one-step rewrite constraints is decidable. A decision algorithm is presented and the proof of its correctness is given.
- Goethe University Frankfurt Germany
- Johann Wolfgang Goethe-Universitaet Germany
ddc:004, unification, string unification, 004, Mechanization of proofs and logical operations, Decidability of theories and sets of sentences, constraint solving, context unification, Theorem proving (deduction, resolution, etc.), automated deduction, ddc: ddc:004
ddc:004, unification, string unification, 004, Mechanization of proofs and logical operations, Decidability of theories and sets of sentences, constraint solving, context unification, Theorem proving (deduction, resolution, etc.), automated deduction, ddc: ddc:004
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).18 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).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!