The following pages link to Jacob M. Howe (Q294782):
Displaying 16 items.
- Abstracting numeric constraints with Boolean functions (Q294784) (← links)
- A pearl on SAT and SMT solving in Prolog (Q428887) (← links)
- Incremental closure for systems of two variables per inequality (Q1733055) (← links)
- (Q2723920) (← links)
- Proof search in Lax Logic (Q2746761) (← links)
- Quadtrees as an Abstract Domain (Q2814109) (← links)
- Two Variables per Linear Inequality as an Abstract Domain (Q3079912) (← links)
- A Pearl on SAT Solving in Prolog (Q3558337) (← links)
- Logahedra: A New Weakly Relational Domain (Q3648708) (← links)
- Efficient groundness analysis in Prolog (Q4452593) (← links)
- Three optimisations for sharing (Q4452604) (← links)
- Worst-case groundness analysis using definite Boolean functions (Q4452643) (← links)
- (Q4518882) (← links)
- Two loop detection mechanisms: A comparison (Q4610326) (← links)
- (Q4736508) (← links)
- Program Development in Computational Logic (Q5712547) (← links)
