SAT-Based Subsumption Resolution (Q6492740)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7838487

Language	Label	Description	Also known as
English	SAT-Based Subsumption Resolution	scientific article; zbMATH DE number 7838487

Statements

scholarly article

0 references

SAT-Based Subsumption Resolution (English)

0 references

0 references

0 references

Michael G. Rawson

0 references

0 references

publication date

26 April 2024

0 references

MaRDI profile type

MaRDI publication profile

0 references

Rewrite-based Equational Theorem Proving with Selection and Simplification

0 references

0 references

Subsumption demodulation in first-order theorem proving

0 references

0 references

Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning

0 references

0 references

0 references

Simple and Efficient Clause Subsumption with Feature Vector Indexing

0 references

Faster, higher, stronger: E 2.3

0 references

The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0

0 references

AVATAR: The Architecture for First-Order Theorem Provers

0 references

Identifiers

10.1007/978-3-031-38499-8_11

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6492740

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