Two Loop Detection Mechanisms: A Comparision. - Jacob M. Howe (TABLEAUX, 1997)

Proof search issues in some non-classical logics. - Jacob M. Howe (1998)

Specialising Finite Domain Programs Using Polyhedra. - Jacob M. Howe; Andy King (ECOOP Workshops, 1999)

Specialising Fininte Domain Programs Using Polyhedra. - Jacob M. Howe; Andy King (LOPSTR, 1999)

Implementing Groundness Analysis with Definite Boolean Functions. - Jacob M. Howe; Andy King (ESOP, 2000)

Abstracting numeric constraints with Boolean functions. - Jacob M. Howe; Andy King (Inf. Process. Lett., 2000)

Positive Boolean Functions as Multiheaded Clauses. - Jacob M. Howe; Andy King (ICLP, 2001)

Proof search in Lax Logic. - Jacob M. Howe (Math. Struct. Comput. Sci., 2001)

Worst-case groundness analysis using definite boolean functions. - Samir Genaim; Jacob M. Howe; Michael Codish (Theory Pract. Log. Program., 2001)

Two Variables per Linear Inequality as an Abstract Domain. - Axel Simon; Andy King; Jacob M. Howe (LOPSTR, 2002)

Efficient Groundness Analysis in Prolog. - Jacob M. Howe; Andy King (Theory Pract. Log. Program., 2003)

Three Optimisations for Sharing. - Jacob M. Howe; Andy King (Theory Pract. Log. Program., 2003)

Analysing Logic Programs by Reasoning Backwards. - Jacob M. Howe; Andy King; Lunjin Lu (Program Development in Computational Logic, 2004)

Integer Polyhedra for Program Analysis. - Philip J. Charles; Jacob M. Howe; Andy King (AAIM, 2009)

Logahedra: A New Weakly Relational Domain. - Jacob M. Howe; Andy King (ATVA, 2009)

A Pearl on SAT Solving in Prolog. - Jacob M. Howe; Andy King (FLOPS, 2010)

Quadtrees as an Abstract Domain. - Jacob M. Howe; Andy King; Charles Lawrence-Jones (NSAD@SAS, 2010)

Polyhedral Analysis Using Parametric Objectives. - Jacob M. Howe; Andy King (SAS, 2012)

A pearl on SAT and SMT solving in Prolog. - Jacob M. Howe; Andy King (Theor. Comput. Sci., 2012)

Theory propagation and rational-trees. - Edward Robbins 001; Jacob M. Howe; Andy King (PPDP, 2013)

Theory propagation and reification. - Edward Robbins 001; Jacob M. Howe; Andy King (Sci. Comput. Program., 2015)

Inductive Learning in Shared Neural Multi-Spaces. - Edjard de Souza Mota; Jacob M. Howe; Artur S. d'Avila Garcez (NeSy, 2017)

Category-based Inductive Learning in Shared NeMuS. - Ana Carolina Melik Schramm; Edjard de Souza Mota; Jacob M. Howe; Artur S. d'Avila Garcez (NeSy, 2017)

Learning about Actions and Events in Shared NeMuS. - Milena Rodrigues Tenorio; Edjard de Souza Mota; Jacob M. Howe; Artur S. d'Avila Garcez (NeSy, 2017)

Theory learning with symmetry breaking. - Jacob M. Howe; Edward Robbins 001; Andy King (PPDP, 2017)

Detecting Cross-Site Scripting Attacks Using Machine Learning. - Fawaz A. Mereani; Jacob M. Howe (AMLTA, 2018)

Preventing Cross-Site Scripting Attacks by Combining Classifiers. - Fawaz A. Mereani; Jacob M. Howe (IJCCI, 2018)

Exact and Approximate Rule Extraction from Neural Networks with Boolean Features. - Fawaz A. Mereani; Jacob M. Howe (IJCCI, 2019)

Efficient Predicate Invention using Shared NeMuS. - Edjard Mota; Jacob M. Howe; Ana Schramm; Artur S. d'Avila Garcez (NeSy@IJCAI, 2019)

Incremental Closure for Systems of Two Variables Per Inequality. - Jacob M. Howe; Andy King; Axel Simon (Theor. Comput. Sci., 2019)

Classification of Date Fruits in a Controlled Environment Using Convolutional Neural Networks. - Wadha S. N. Alhamdan; Jacob M. Howe (AMLTA, 2021)

Backjumping is Exception Handling. - Ed Robbins 001; Andy King; Jacob M. Howe (Theory Pract. Log. Program., 2021)

Widening for Systems of Two Variables Per Inequality. - Martin Brain; Jacob M. Howe (SC-Square@ISSAC, 2023)