City Research Online

Article

Robbins, E., King, A. & Howe, J. M. ORCID: 0000-0001-8013-6941 (2020). Backjumping is Exception Handling. Theory and Practice of Logic Programming, 21(2), pp. 125-144. doi: 10.1017/S1471068420000435

Howe, J. M. ORCID: 0000-0001-8013-6941, King, A. & Simon, A. (2019). Incremental closure for systems of two variables per inequality. Theoretical Computer Science, 768, pp. 1-42. doi: 10.1016/j.tcs.2018.12.001

Mereani, F. & Howe, J. M. ORCID: 0000-0001-8013-6941 (2019). Exact and Approximate Rule Extraction from Neural Networks with Boolean Features. Proceedings of the 11th International Joint Conference on Computational Intelligence, 1, pp. 424-433. doi: 10.5220/0008362904240433

Howe, J. M. & Mereani, F. (2018). Detecting Cross-Site Scripting Attacks Using Machine Learning. Advances in Intelligent Systems and Computing, 723, pp. 200-210. doi: 10.1007/978-3-319-74690-6_20

Howe, J. M., Mota, E.D. & Garcez, A. (2017). Inductive learning in Shared Neural Multi-Spaces. CEUR Workshop Proceedings, 2003,

Schramm, A. C. M., Mota, E. D. S., Howe, J. M. & Garcez, A. S. D.view all authors (2017). Category-based Inductive Learning in Shared NeMuS. CEUR Workshop Proceedings, 2003,

Howe, J. M., Robbins, E. & King, A. (2017). Theory Learning with Symmetry Breaking. Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Part F, pp. 85-96. doi: 10.1145/3131851.3131861

Robbins, E., Howe, J. M. & King, A. (2015). Theory propagation and reification. Science of Computer Programming, 111(P1), pp. 3-22. doi: 10.1016/j.scico.2014.05.013

Robbins, E., Howe, J. M. & King, A. (2013). Theory propagation and rational-trees. Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP 2013, pp. 193-204.

Howe, J. M. & King, A. (2012). A pearl on SAT and SMT solving in Prolog. Theoretical Computer Science, 435, pp. 43-55. doi: 10.1016/j.tcs.2012.02.024

Howe, J. M. & King, A. (2012). Polyhedral Analysis using Parametric Objectives. Lecture Notes on Computer Science, 7460, pp. 41-57. doi: 10.1007/978-3-642-33125-1_6

Howe, J. M. & King, A. (2011). A Pearl on SAT Solving in Prolog (extended abstract). ALP Newsletter(3),

Howe, J. M., King, A. & Lawrence-Jones, C. (2010). Quadtrees as an Abstract Domain. Electronic Notes Theoretical Computer Science, 267(1), pp. 89-100. doi: 10.1016/j.entcs.2010.09.008

Charles, P. J., Howe, J. M. & King, A. (2009). Integer polyhedra for program analysis. Algorithmic Aspects in Information and Management, Lecture Notes in Computer Science, 5564, pp. 85-99. doi: 10.1007/978-3-642-02158-9_9

Howe, J. M. & King, A. (2009). Logahedra: A new weakly relational domain. Lecture Notes in Computer Science, 5799, pp. 306-320. doi: 10.1007/978-3-642-04761-9_23

Howe, J. M. & King, A. (2003). Efficient groundness analysis in Prolog. Theory and Practice of Logic Programming, 3(1), pp. 95-124. doi: 10.1017/s1471068402001485

Simon, A., King, A. & Howe, J. M. (2003). Two variables per linear inequality as an abstract domain. Logic based program synthesis and transformation, 2664, pp. 71-89. doi: 10.1007/3-540-45013-0_7

Howe, J. M. (2001). Proof search in Lax Logic. Mathematical Structures in Computer Science, 11(04), pp. 573-588. doi: 10.1017/s0960129501003334

Howe, J. M. & King, A. (2000). Abstracting Numeric Constraints with Boolean Functions. Information Processing Letters, 75(1-2), pp. 17-23. doi: 10.1016/s0020-0190(00)00081-8

Howe, J. M. & King, A. (2000). Implementing Groundness Analysis with Definite Boolean Functions. Lecture Notes in Computer Science, 1782, pp. 200-214.

Book Section

Howe, J. M. & King, A. (2010). A pearl on SAT solving in Prolog. In: International Symposium on Functional and Logic Programming, pages 165-174. Lecture Notes in Computer Science (6009). . Springer. doi: 10.1007/978-3-642-12251-4_13

Conference or Workshop Item

Gàmez Montolio, A., Florit, E., Brain, M. ORCID: 0000-0003-4216-7151 & Howe, J. ORCID: 0000-0001-8013-6941view all authors (2024). Efficient Normalized Reduction and Generation of Equivalent Multivariate Binary Polynomials. Paper presented at the Workshop on Binary Analysis Research, 1 Mar 2024, San Diego, USA. doi: 10.14722/bar.2024.23014

Howe, J. M. ORCID: 0000-0001-8013-6941 & Nyx Brain, M. (2023). Widening for Systems of Two Variables Per Inequality. In: CEUR Workshop Proceedings. 8th SC-Square Workshop, 28 Jul 2023, Tromsø, Norway.

Mereani, F. & Howe, J. M. ORCID: 0000-0001-8013-6941 (2021). Rule Extraction from Neural Networks and Other Classifiers Applied to XSS Detection. In: Morelo, J. J., Garibaldi, J., Linares-Barranco, A. , Warwick, K. & Madani, K.view all authors (Eds.), Computational Intelligence. 11th International Joint Conference, IJCCI 2019, 17-19 Sep 2019, Vienna, Austria. doi: 10.1007/978-3-030-70594-7_15

Alhamdan, W. & Howe, J. M. ORCID: 0000-0001-8013-6941 (2021). Classification of date fruits in a controlled environment using Convolutional Neural Networks. In: Hassanien, A. E., Chang, K. C. & Mincong, T. (Eds.), AMLTA 2021: Advanced Machine Learning Technologies and Applications. doi: 10.1007/978-3-030-69717-4_16

Mota, E., Howe, J. M. ORCID: 0000-0001-8013-6941, Schramm, A. & d'Avila Garcez, A. S.view all authors (2019). Efficient Predicate Invention using Shared NeMuS. In: 14th International Workshop on Neural-Symbolic Learning and Reasoning. 14th International Workshop on Neural-Symbolic Learning and Reasoning, 10 - 16 August 2019, Macau, China.

Mereani, F. & Howe, J. M. ORCID: 0000-0001-8013-6941 (2018). Preventing Cross-Site Scripting Attacks by Combining Classifiers. In: Proceedings of the 10th International Joint Conference on Computational Intelligence. International Joint Conference on Computational Intelligence, 18-20 Sep 2018, Seville, Spain.

Tenório, M. R., Mota, E. D. S., Howe, J. M. & Garcez, A. S. D. A.view all authors (2017). Learning about Actions and Events in Shared NeMuS. In: CEUR Workshop Proceedings. Twelfth International Workshop on Neural-Symbolic Learning and Reasoning (NeSy 2017), July 17-18, 2017, London, UK.

Howe, J. M. & King, A. (2001). Positive Boolean Functions as Multiheaded Clauses. In: Codognet, P (Ed.), LNCS. International Conference on Logic Programming, 26 Nov - 01 Dec 2001, Cyprus.

Howe, J. M. & King, A. (2000). Specialising finite domain programs with polyhedra. Paper presented at the Logic Programming Synthesis and Transformation 1999, 22 - 24 September 1999, Venezia, Italy.

Howe, J. M. (1997). Two loop detection mechanisms: a comparison. In: LNCS. International Conference on Analytic Tableaux and Related Methods (TABLEAUX'97), 13 - 16 May 1997, Pont-a-Mousson, France.

Report

Howe, J. M., King, A. & Lawrence-Jones, C. (2010). Quadtrees as an Abstract Domain (TR_2010_DOC_01). .

Howe, J. M. & King, A. (2009). Closure Algorithms for Domains with Two Variables Per Inequality (TR/2009/DOC/01). .

Thesis

Howe, J. M. (1998). Proof search issues in some non-classical logics. (Unpublished Doctoral thesis, University of St Andrews)