Certification of Termination Proofs Using CeTA (Q3183545): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Termination of term rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of Automated Termination Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying a Termination Criterion Based on Graphs, without Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Programming, Artificial Intelligence, and Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontiers of Combining Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automating the dependency pair method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tyrolean termination tool: techniques and features / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Unification Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414308 / rank
 
Normal rank

Latest revision as of 02:27, 2 July 2024

scientific article
Language Label Description Also known as
English
Certification of Termination Proofs Using CeTA
scientific article

    Statements