The following pages link to (Q4993362):
Displaying 15 items.
- Strict completion of logic programs (Q751309) (← links)
- Completion of rewrite systems with membership constraints. I: Deduction rules (Q1264438) (← links)
- Runtime complexity analysis of logically constrained rewriting (Q2119101) (← links)
- Term Rewriting with Logical Constraints (Q2849501) (← links)
- Completeness of rewrite rules and rewrite strategies for FP (Q3476266) (← links)
- (Q3490948) (← links)
- Tight, consistent, and computable completions for unrestricted logic programs (Q4036289) (← links)
- (Q4217958) (← links)
- Extending Maximal Completion (Invited Talk) (Q5089002) (← links)
- Predicate Completion for non-Horn Clause Sets (Q5200033) (← links)
- Completion of rewrite systems with membership constraints (Q5204334) (← links)
- Involutive Completion to Avoid LBB Condition (Q5503127) (← links)
- Operationally-based program equivalence proofs using LCTRSs (Q6052946) (← links)
- Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting (Q6052950) (← links)
- Transforming concurrent programs with semaphores into logically constrained term rewrite systems (Q6671788) (← links)
