Browse by Person (creator, editor, contributor, etc.)

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 26.

Robbins, Ed and Howe, Jacob M. and King, Andy (2014) Theory Propagation and Reification. Science of Computer Programming . ISSN 0167-6423. (In press) (Access to this publication is restricted)
[img]

Howe, Jacob M. and King, Andy (2012) Polyhedral Analysis using Parametric Objectives. In: Min'e, Antoine and Schmidt, David A., eds. Static Analysis Symposium. Lecture Notes in Computer Science, 7460 . Springer, pp. 41-57. ISBN 978-3-642-33124-4. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy (2012) A Pearl on SAT and SMT Solving in Prolog. Theoretical Computer Science, 435 . pp. 43-55. ISSN 0304-3975. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy (2011) A Pearl on SAT Solving in Prolog (Logic Programming Newsletter). Logic Programming Newsletter, 2011 (3). pp. 182-196. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy and Lawrence-Jones, Charles (2010) Quadtrees as an Abstract Domain. Electronic Notes in Theoretical Computer Science, 267 (1). pp. 182-196. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy (2010) A Pearl on SAT Solving in Prolog. In: Blume, Matthias and Vidal, German, eds. Functional and Logic Programming. Lecture Notes in Computer Science . Springer-Verlag, pp. 182-196. ISBN 978-3-642-12250-7. (Full text available)
[img]
Preview

Simon, Axel and King, Andy and Howe, Jacob M. (2010) The Two Variable Per Inequality Abstract Domain. Higher-Order and Symbolic Computation, 31 (1). pp. 182-196. (Full text available)
[img]
Preview

Charles, Philip and King, Andy and Howe, Jacob M. (2009) Integer Polyhedra for Program Analysis. In: Goldberg, Andrew and Zhou, Yunhong, eds. Algorithmic Aspects in Information and Management,. Lecture Notes in Computer Science, 5564 . Springer, pp. 85-99. ISBN 9783642021572. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy (2009) Logahedra: a New Weakly Relational Domain. In: Zhiming, Lu and Anders, Ravn, eds. Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, 5799 . Springer, pp. 306-320. ISBN 9783642047602. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy and Lu, Lunjin (2004) Analysing Logic Programs by Reasoning Backwards. In: Bruynooghe, Maurice and Lau, Kung-Kiu, eds. Program Development in Computational Logic. Lecture Notes in Computer Science, 3049 . Springer, pp. 152-188. ISBN 9783540221524. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy (2003) Three Optimisations for Sharing. Theory and Practice of Logic Programming, 3 (2). pp. 243-257. ISSN 1471-0684. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy (2003) Efficient Groundness Analysis in Prolog. Theory and Practice of Logic Programming, 3 (1). pp. 95-124. ISSN 1471-0684. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy (2002) Correctness of Set-Sharing with Linearity. University of Kent, School of Computing, Canterbury, 5 pp. (Full text available)
[img]
Preview

Simon, Axel and King, Andy and Howe, Jacob M. (2002) Two Variables per Linear Inequality as an Abstract Domain. In: Leuschel, Michael, ed. Logic Based Program Synthesis and Transformation. Lecture Notes in Computer Science, 2664 . Springer-Verlag, Berlin, pp. 71-89. ISBN 978-3-540-40438-5. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy (2001) Positive Boolean Functions as Multiheaded Clauses. In: Codognet, Philippe, ed. International Conference on Logic Programming. Lecture Notes in Computer Science, 2237 . Springer-Verlag, London, pp. 120-134. ISBN 3-540-42935-2. (Full text available)
[img]
Preview

Howe, Jacob M. (2001) Proof Search in Lax Logic. Mathematical Structures in Computer Science, 11 (4). pp. 573-588. ISSN 0960-1295. (Full text available)
[img]
Preview
[img]
Preview

Howe, Jacob M. and King, Andy (2001) Widening BDDs. University of Kent, School of Computing, 9 pp. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy (2000) Abstracting numeric constraints with Boolean functions. Information Processing Letters, 75 (1-2). pp. 17-23. ISSN 0020-0190. (Full text available)
[img]
Preview
[img]

Howe, Jacob M. and King, Andy (2000) Implementing Groundness Analysis with Definite Boolean Functions. In: Smolka, Gert, ed. European Symposium on Programming. Lecture Notes in Computer Science, 1782 . Springer, pp. 200-214. ISBN 9783540672623. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy (1999) A Semantic Basis for Specialising Domain Constraints. University of Kent, School of Computing, Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK, 12 pp. (Full text available)
[img]
Preview

Howe, Jacob M. (1999) Proof Search in Lax Logic. Technical report. (Full text available)
[img]
Preview
[img]
Preview

Howe, Jacob M. and King, Andy (1999) Specialising Finite Domain Programs using Polyhedra. In: Bossi, Annalisa, ed. Lecture Notes In Computer Science. Lecture Notes in Computer Science, 1817 . Springer-Verlag, pp. 118-135. ISBN 978-3-540-67628-7. (Full text available)
[img]
Preview

Howe, Jacob M. (1998) Proof Search Issues in Some Non-Classical Logics. Doctor of Philosophy (PhD) thesis, University of St Andrews. (Full text available)
[img] [img]
Preview

Howe, Jacob M. (1998) A `Permutation-free' Calculus for Lax Logic. Technical report. (Full text available)
[img]
Preview
[img]
Preview

Howe, Jacob M. (1997) Two Loop Detection Mechanisms: A Comparison. In: TABLEAUX'97, May 13-16, 1997, Pont A Mousson, France, . (Full text available)
[img] [img]
Preview

Howe, Jacob M. (1996) Theorem Proving and Partial Proof Search for Intuitionistic Propositional Logic Using a Permutation-free Calculus with Loop-Checking. Technical report. (Full text available)
[img]
Preview
[img]
Preview

This list was generated on Tue Sep 2 05:31:09 2014 BST.