Pages that link to "Item:Q802317"
From MaRDI portal
The following pages link to Refutational theorem proving using term-rewriting systems (Q802317):
Displaying 13 items.
- Conditional rewrite rule systems with built-in arithmetic and induction (Q5055742) (← links)
- Boolean algebra admits no convergent term rewriting system (Q5055766) (← links)
- Incremental techniques for efficient normalization of nonlinear rewrite systems (Q5055772) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Ordered Binary Decision Diagrams and the Davis-Putnam procedure (Q5096299) (← links)
- Buchberger's algorithm: A constraint-based completion procedure (Q5096314) (← links)
- Incremental Proofs of Termination, Confluence and Sufficient Completeness of OBJ Specifications (Q5403069) (← links)
- Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs (Q5403086) (← links)
- A Groebner Bases Based Many-Valued Modal Logic Implementation in Maple (Q5505497) (← links)
- Could orders be captured by term rewriting systems? (Q5881195) (← links)
- Completion procedures as semidecision procedures (Q5881279) (← links)
- Towards automated deduction in cP systems (Q6154793) (← links)
- An inference engine for propositional two-valued logic based on the radical membership problem (Q6560374) (← links)