Semantic trees revisited: some new completeness results
From MaRDI portal
Publication:4647548
DOI10.1007/3-540-61511-3_114zbMATH Open1412.68222OpenAlexW1533172286MaRDI QIDQ4647548FDOQ4647548
Authors: Christian G. Fermüller 
Publication date: 15 January 2019
Published in: Automated Deduction — Cade-13 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61511-3_114
Recommendations
Cites Work
- Title not available (Why is that?)
- Removing redundancy from a clause
- A Machine-Oriented Logic Based on the Resolution Principle
- Title not available (Why is that?)
- Proving refutational completeness of theorem-proving strategies
- Automatic Theorem Proving With Renamable and Semantic Resolution
- Title not available (Why is that?)
- Resolution-based theorem proving for many-valued logics
- On Different Concepts of Resolution
- Resolution Strategies as Decision Procedures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resolution methods for the decision problem
- Reduction rules for resolution-based systems
- Title not available (Why is that?)
Cited In (8)
- Proving refutational completeness of theorem-proving strategies
- Beyond representing orthology relations by trees
- The blossom of finite semantic trees
- Semantics of trees
- Trees and semantics
- Title not available (Why is that?)
- Nested semantics over finite trees are equationally hard (invited talk)
- Title not available (Why is that?)
Uses Software
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)
