Equational theorem proving modulo (Q2055853)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Equational theorem proving modulo	scientific article

Statements

scholarly article

0 references

Equational theorem proving modulo (English)

0 references

10.1007/978-3-030-79876-5_10

0 references

Christopher Lynch

0 references

0 references

publication date

1 December 2021

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-79876-5_10

0 references

0 references

Automated Reasoning

0 references

Term Rewriting and All That

0 references

0 references

Completion for rewriting modulo a congruence

0 references

Rewrite-based Equational Theorem Proving with Selection and Simplification

0 references

0 references

Basic paramodulation

0 references

Paramodulation with non-monotonic orderings and simplification

0 references

0 references

Polarized Resolution Modulo

0 references

Theorem proving modulo

0 references

Associative unification and symbolic reasoning modulo associativity in Maude

0 references

Folding variant narrowing and optimal variant termination

0 references

Equational theorem proving modulo

0 references

An RPO-Based Ordering Modulo Permutation Equations and Its Applications to Rewrite Systems

0 references

Reviving basic narrowing modulo

0 references

0 references

Paramodulation with built-in AC-theories and symbolic constraints

0 references

0 references

0 references

A Machine-Oriented Logic Based on the Resolution Principle

0 references

Associative-commutative deduction with constraints

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2055853

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2055853&oldid=36744546"