Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation (Q5881277): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-54317-1_90 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1537313229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion-time optimization of rewrite-time goal solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3817656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of equational logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040341 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:50, 31 July 2024

scientific article; zbMATH DE number 7661648
Language Label Description Also known as
English
Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation
scientific article; zbMATH DE number 7661648

    Statements

    Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation (English)
    0 references
    0 references
    9 March 2023
    0 references

    Identifiers