On the efficiency of subsumption algorithms
From MaRDI portal
Recommendations
Cited in
(23)- Subsumption and implication
- Reduction rules for resolution-based systems
- A new subsumption method in the connection graph proof procedure
- Recursive query processing: The power of logic
- Thue trees
- The anatomy of vampire. Implementing bottom-up procedures with code trees
- Optimizations of the subresultant algorithm
- An efficient subsumption test pipeline for BS(LRA) clauses
- scientific article; zbMATH DE number 3862479 (Why is no real title available?)
- A restarted strategy for efficient subsumption testing
- scientific article; zbMATH DE number 3945370 (Why is no real title available?)
- scientific article; zbMATH DE number 4066861 (Why is no real title available?)
- scientific article; zbMATH DE number 4072424 (Why is no real title available?)
- European Summer Meeting of the Association for Symbolic Logic, Paris, 1985
- scientific article; zbMATH DE number 970722 (Why is no real title available?)
- Subsumption algorithms based on search trees
- AI*IA 2003: Advances in Artificial Intelligence
- Fully abstract compositional semantics for an algebra of logic programs
- Removing redundancy from a clause
- SAT solving for variants of first-order subsumption
- Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms
- Generating efficient diagnostic procedures from model-based knowledge using logic programming techniques
- Deciding expressive description logics in the framework of resolution
This page was built for publication: On the efficiency of subsumption algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771609)
