Equational Theorem Proving for Clauses over Strings (Q6118747): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q121863166, #quickstatements; #temporary_batch_1721947977513 |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.4204/eptcs.376.6 / rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4353057074 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A rewriting approach to satisfiability procedures. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Term Rewriting and All That / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rewrite-based Equational Theorem Proving with Selection and Simplification / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4524792 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5503674 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Testing for the Church-Rosser property / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4846257 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2747613 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A completion procedure for finitely presented groups that is based on word cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Conditional semi-Thue systems for presenting monoids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4036569 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2751361 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4003861 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unification and matching modulo nilpotence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4650358 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Knuth-Bendix Completion Procedure and Thue Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equational theorem proving modulo / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4428306 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient SMT solver for string constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4036570 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2751359 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cross-sections for finitely presented monoids with decidable word problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON PRESENTATIONS OF COMMUTATIVE MONOIDS / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.4204/EPTCS.376.6 / rank | |||
Normal rank |
Latest revision as of 18:37, 30 December 2024
scientific article; zbMATH DE number 7810645
Language | Label | Description | Also known as |
---|---|---|---|
English | Equational Theorem Proving for Clauses over Strings |
scientific article; zbMATH DE number 7810645 |
Statements
Equational Theorem Proving for Clauses over Strings (English)
0 references
28 February 2024
0 references