Semantic trees revisited: some new completeness results
From MaRDI portal
Publication:4647548
Recommendations
Cites work
- scientific article; zbMATH DE number 3684933 (Why is no real title available?)
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 512974 (Why is no real title available?)
- scientific article; zbMATH DE number 3310921 (Why is no real title available?)
- scientific article; zbMATH DE number 3346109 (Why is no real title available?)
- scientific article; zbMATH DE number 3415409 (Why is no real title available?)
- A Machine-Oriented Logic Based on the Resolution Principle
- Automatic Theorem Proving With Renamable and Semantic Resolution
- On Different Concepts of Resolution
- Proving refutational completeness of theorem-proving strategies
- Reduction rules for resolution-based systems
- Removing redundancy from a clause
- Resolution Strategies as Decision Procedures
- Resolution methods for the decision problem
- Resolution-based theorem proving for many-valued logics
Cited in
(8)- Proving refutational completeness of theorem-proving strategies
- Beyond representing orthology relations by trees
- The blossom of finite semantic trees
- Trees and semantics
- Semantics of trees
- Nested semantics over finite trees are equationally hard (invited talk)
- scientific article; zbMATH DE number 1929148 (Why is no real title available?)
- scientific article; zbMATH DE number 4049135 (Why is no real title available?)
This page was built for publication: Semantic trees revisited: some new completeness results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647548)