Pages that link to "Item:Q3771609"
From MaRDI portal
The following pages link to On the efficiency of subsumption algorithms (Q3771609):
Displaying 18 items.
- Fully abstract compositional semantics for an algebra of logic programs (Q672703) (← links)
- Removing redundancy from a clause (Q685346) (← links)
- Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms (Q800318) (← links)
- Generating efficient diagnostic procedures from model-based knowledge using logic programming techniques (Q805270) (← links)
- Deciding expressive description logics in the framework of resolution (Q924723) (← links)
- Subsumption and implication (Q1094152) (← links)
- Reduction rules for resolution-based systems (Q1187214) (← links)
- A new subsumption method in the connection graph proof procedure (Q1199542) (← links)
- Recursive query processing: The power of logic (Q1262144) (← links)
- Thue trees (Q1861534) (← links)
- The anatomy of vampire. Implementing bottom-up procedures with code trees (Q1904404) (← links)
- Optimizations of the subresultant algorithm (Q1963982) (← links)
- An efficient subsumption test pipeline for BS(LRA) clauses (Q2104505) (← links)
- Subsumption Algorithms for Three-Valued Geometric Resolution (Q2817925) (← links)
- (Q3800017) (← links)
- European Summer Meeting of the Association for Symbolic Logic, Paris, 1985 (Q4724593) (← links)
- Subsumption algorithms based on search trees (Q5878906) (← links)
- AI*IA 2003: Advances in Artificial Intelligence (Q5897319) (← links)