dblp.uni-trier.dewww.uni-trier.de

Jacob M. Howe

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2004
14EEJacob M. Howe, Andy King, Lunjin Lu: Analysing Logic Programs by Reasoning Backwards. Program Development in Computational Logic 2004: 152-188
2003
13 Jacob M. Howe, Andy King: Efficient Groundness Analysis in Prolog. TPLP 3(1): 95-124 (2003)
12 Jacob M. Howe, Andy King: Three Optimisations for Sharing. TPLP 3(2): 243-257 (2003)
2002
11EEAxel Simon, Andy King, Jacob M. Howe: Two Variables per Linear Inequality as an Abstract Domain. LOPSTR 2002: 71-89
10EEJacob M. Howe, Andy King: Efficient Groundness Analysis in Prolog CoRR cs.PL/0201012: (2002)
9EEJacob M. Howe, Andy King: Three Optimisations for Sharing CoRR cs.PL/0203022: (2002)
2001
8EEJacob M. Howe, Andy King: Positive Boolean Functions as Multiheaded Clauses. ICLP 2001: 120-134
7 Jacob M. Howe: Proof search in Lax Logic. Mathematical Structures in Computer Science 11(4): 573-588 (2001)
6 Samir Genaim, Jacob M. Howe, Michael Codish: Worst-case groundness analysis using definite boolean functions. TPLP 1(5): 611-615 (2001)
2000
5EEJacob M. Howe, Andy King: Implementing Groundness Analysis with Definite Boolean Functions. ESOP 2000: 200-214
4EEJacob M. Howe, Andy King: Abstracting numeric constraints with Boolean functions. Inf. Process. Lett. 75(1-2): 17-23 (2000)
1999
3 Jacob M. Howe, Andy King: Specialising Finite Domain Programs Using Polyhedra. ECOOP Workshops 1999: 258-259
2 Jacob M. Howe, Andy King: Specialising Fininte Domain Programs Using Polyhedra. LOPSTR 1999: 118-135
1997
1 Jacob M. Howe: Two Loop Detection Mechanisms: A Comparision. TABLEAUX 1997: 188-200

Coauthor Index

1Michael Codish [6]
2Samir Genaim [6]
3Andy King [2] [3] [4] [5] [8] [9] [10] [11] [12] [13] [14]
4Lunjin Lu [14]
5Axel Simon [11]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)