Pages that link to "Item:Q1170894"
From MaRDI portal
The following pages link to A simplified problem reduction format (Q1170894):
Displaying 12 items.
- Term rewriting: Some experimental results (Q757071) (← links)
- Refutational theorem proving using term-rewriting systems (Q802317) (← links)
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler (Q1114446) (← links)
- TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic (Q1332639) (← links)
- Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures (Q1340966) (← links)
- Non-Horn clause logic programming (Q1402738) (← links)
- Renaming a set of non-Horn clauses (Q1587332) (← links)
- Near-Horn Prolog and the ancestry family of procedures (Q1924724) (← links)
- History and Prospects for First-Order Automated Deduction (Q3454079) (← links)
- Automatic theorem proving. II (Q3793764) (← links)
- The search efficiency of theorem proving strategies (Q5210762) (← links)
- Conditional term rewriting and first-order theorem proving (Q5881190) (← links)