Items where City Author is "Howe, J. M."
Group by: Item Type | No Grouping Number of items: 22. ArticleHowe, 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, 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(1), 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(4), 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 SectionHowe, 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. Conference or Workshop ItemHowe, J. M., Mota, E.D. & Garcez, A. (2017). Inductive learning in Shared Neural Multi-Spaces. Paper presented at the Twelfth International Workshop on Neural-Symbolic Learning and Reasoning 2017, July 17-18, 2017, London, UK. Howe, J. M. & King, A. (2001). Positive Boolean Functions as Multiheaded Clauses. Paper presented at the 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. Paper presented at the International Conference on Analytic Tableaux and Related Methods (TABLEAUX'97), 13 - 16 May 1997, Pont-a-Mousson, France. ThesisHowe, J. M. (1998). Proof search issues in some non-classical logics. (Unpublished Doctoral thesis, University of St Andrews) ReportHowe, J. M., King, A. & Lawrence-Jones, C. (2010). Quadtrees as an Abstract Domain (Report No. TR_2010_DOC_01). . Howe, J. M. & King, A. (2009). Closure Algorithms for Domains with Two Variables Per Inequality (Report No. TR/2009/DOC/01). . |