Searching for "Ordered Semantic Hyper-Linking." – sorted by Relevance.
-
Ordered Semantic Hyper-Linking
- MAX-PLANCK-INSTITUT F UR INFORMATIK \Omega \Psi ff \Phi Ordered Semantic Hyper-Linking David A
- Cited by 17 (2 self) – Add To MetaCart
-
Efficient First-Order Semantic Deduction Techniques
- problems. We analyze the complexity of ordered semantic hyper linking using a novel concept of theorem
- Add To MetaCart
-
An Improved Propositional Approach to First-Order Theorem Proving
- |plaisted]@(email omitted); Abstract. Ordered semantic hyper-linking (OSHL) is a theorem prover for first-order logic that generates
- Add To MetaCart
-
A First-Order Logic Davis-Putnam-Logemann-Loveland Procedure
- Ordered Semantic Hyper Linking calculus (OSHL) (Lee and Plaisted 1993; Plaisted and Zhu 2000). Both SHL
- Cited by 35 (5 self) – Add To MetaCart
-
A Partial Instantiation based First Order Theorem Prover
- [18] to detect propositional unsatisfiability. Ordered semantic hyper linking [13] improves upon CLIN
- Cited by 2 (0 self) – Add To MetaCart
-
A Confluent Connection Calculus
- ] and ordered semantic hyper linking [Plaisted and Zhu, 1997] . Usually the price for getting around rigid
- Cited by 10 (2 self) – Add To MetaCart

