The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jacob M. Howe: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  15. Integer Polyhedra for Program Analysis. [Citation Graph (, )][DBLP]


  16. Logahedra: A New Weakly Relational Domain. [Citation Graph (, )][DBLP]


  17. A Pearl on SAT Solving in Prolog. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002