The following pages link to (Q5663380):
Displaying 19 items.
- A graph unification machine for NL parsing (Q597235) (← links)
- Theory matrices (for modal logics) using alphabetical monotonicity (Q687154) (← links)
- Structure sharing for quantified terms: Fundamentals (Q911773) (← links)
- The calculus of context relations (Q918720) (← links)
- The implementation of FPROLOG - a fuzzy PROLOG interpreter (Q1096409) (← links)
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler (Q1114446) (← links)
- Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks (Q1143818) (← links)
- Representing scope in intuitionistic deductions (Q1274448) (← links)
- Resolution theorem proving in reified modal logics (Q1332644) (← links)
- An ordering linear unification algorithm (Q1824410) (← links)
- Boolean unification - the story so far (Q1824411) (← links)
- On equational theories, unification, and (un)decidability (Q1825184) (← links)
- Lazy structure sharing for query optimization (Q1892716) (← links)
- Milestones from the Pure Lisp Theorem Prover to ACL2 (Q2280212) (← links)
- Source-tracking unification (Q2568436) (← links)
- Pre-indexed Terms for Prolog (Q2949716) (← links)
- Fuzzy logic programming (Q5946475) (← links)
- Fifty Years of Prolog and Beyond (Q6063890) (← links)
- Correctness of procedure representations in higher-order assembly language (Q6116577) (← links)