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

Group by: Item Type | Date | No Grouping

Jump to: Article | Monograph | Conference or workshop item | Thesis

Number of items: 21.

Article

Howe, J.M. and King, A. (2003) Efficient Groundness Analysis in Prolog. Theory and Practice of Logic Programming, 3 (1). pp. 95-124. ISSN 1471-0684. The full text of this publication is not available from this repository.

Howe, J.M. and King, A. (2003) Three Optimisations for Sharing. Theory and Practice of Logic Programming, 3 (2). pp. 243-257. ISSN 1471-0684. The full text of this publication is not available from this repository.

Howe, J.M. (2001) Proof Search in Lax Logic. Mathematical Structures in Computer Science, 11 (4). pp. 573-588. ISSN 0960-1295.

Preview

Preview

Howe, J.M. and King, A. (2000) Abstracting numeric constraints with Boolean functions. Information Processing Letters, 75 (1-2). pp. 17-23. ISSN 0020-0190.

Preview

Howe, J.M. and King, A. (2000) Implementing groundness analysis with definite Boolean functions. Lecture Notes in Computer Science, 1782 . pp. 200-214. ISSN 0302-9743.

Preview

Monograph

Howe, J.M. and King, Andy (2002) Correctness of Set-Sharing with Linearity. Technical report. Computing Laboratory, Canterbury

Preview

Preview

Howe, J.M. and King, A. (2001) Efficient Groundness Analysis in Prolog. Technical report. university of kent

Preview

Preview

Howe, J.M. and King, Andy (2001) Three Optimisations for Sharing. Technical report. UKC, University of Kent at Canterbury (Unpublished)

Preview

Preview

Howe, J.M. and King, Andy (2001) Widening BDDs. Technical report. Great Britain:University of Kent

Preview

Preview

Howe, J.M. and King, A. (1999) A Semantic Basis for Specialising Domain Constraints. Technical report. , Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK

Preview

Preview

Howe, J.M. (1999) Proof Search in Lax Logic. Technical report.

Preview

Preview

Howe, J.M. (1998) A `Permutation-free' Calculus for Lax Logic. Technical report.

Preview

Preview

Howe, J.M. (1996) Theorem Proving and Partial Proof Search for Intuitionistic Propositional Logic Using a Permutation-free Calculus with Loop-Checking. Technical report.

Preview

Preview

Conference or workshop item

Howe, J.M. and King, Andy (2009) Logahedra: a New Weakly Relational Domain. In: International Symposium on Automated Technology for Verification and Analysis, OCT 13-16, 2009, Macao, Peoples Republic of China.

Preview

Howe, J.M. and King, Andy and Lu, L. (2004) Analysing Logic Programs by Reasoning Backwards. In: Program Development in Computational Logic.

Preview

Simon, A. and King, Andy and Howe, J.M. (2002) Two Variables per Linear Inequality as an Abstract Domain. In: Leuschel, M., 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.

Preview

Howe, J.M. and King, A. (2001) Positive Boolean Functions as Multiheaded Clauses. In: International Conference on Logic Programming.

Preview

Preview

Howe, J.M. and King, A. (2000) Specialising Finite Domain Programs using Polyhedra. In: Bossi, A., ed. Lecture Notes In Computer Science. Lecture Notes in Computer Science, 1817. Springer-Verlag pp. 118-135. ISBN 978-3-540-67628-7.

Preview

Howe, J.M. and King, A. (1999) Specialising Finite Domain Programs using Polyhedra (Abstract). In: ECOOP’99 Workshops, Panels, and Posters, 14–18 June 1999 , Lisbon, Portugal. The full text of this publication is not available from this repository.

Howe, J.M. (1997) Two Loop Detection Mechanisms: A Comparison. In: TABLEAUX'97, May 13-16, 1997, Pont A Mousson, France, .