Reduction of cycle unification of type \(Cpg+r\) (Q1383467): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Properties of substitutions and unifications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unification theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Implication of clauses is undecidable / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:17, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Reduction of cycle unification of type \(Cpg+r\) |
scientific article |
Statements
Reduction of cycle unification of type \(Cpg+r\) (English)
0 references
20 April 1998
0 references
cycle unification
0 references
SLD resolution method
0 references