Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacob M. Howe
Person information
- affiliation: City University, London, GB
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1998
[b1]Jacob M. Howe:
Proof search issues in some non-classical logics. University of St Andrews, UK, 1998
Journal Articles
- 2021
- [j9]Ed Robbins
, Andy King, Jacob M. Howe:
Backjumping is Exception Handling. Theory Pract. Log. Program. 21(2): 125-144 (2021) - 2019
- [j8]Jacob M. Howe, Andy King, Axel Simon:
Incremental Closure for Systems of Two Variables Per Inequality. Theor. Comput. Sci. 768: 1-42 (2019) - 2015
- [j7]Edward Robbins, Jacob M. Howe, Andy King:
Theory propagation and reification. Sci. Comput. Program. 111: 3-22 (2015) - 2012
- [j6]Jacob M. Howe, Andy King:
A pearl on SAT and SMT solving in Prolog. Theor. Comput. Sci. 435: 43-55 (2012) - 2003
- [j5]Jacob M. Howe, Andy King:
Efficient Groundness Analysis in Prolog. Theory Pract. Log. Program. 3(1): 95-124 (2003) - [j4]Jacob M. Howe, Andy King:
Three Optimisations for Sharing. Theory Pract. Log. Program. 3(2): 243-257 (2003) - 2001
- [j3]Jacob M. Howe:
Proof search in Lax Logic. Math. Struct. Comput. Sci. 11(4): 573-588 (2001) - [j2]Samir Genaim, Jacob M. Howe, Michael Codish:
Worst-case groundness analysis using definite boolean functions. Theory Pract. Log. Program. 1(5): 611-615 (2001) - 2000
- [j1]Jacob M. Howe, Andy King:
Abstracting numeric constraints with Boolean functions. Inf. Process. Lett. 75(1-2): 17-23 (2000)
Conference and Workshop Papers
- 2023
- [c22]Martin Brain, Jacob M. Howe:
Widening for Systems of Two Variables Per Inequality. SC-Square@ISSAC 2023: 11-28 - 2021
- [c21]Wadha S. N. Alhamdan, Jacob M. Howe:
Classification of Date Fruits in a Controlled Environment Using Convolutional Neural Networks. AMLTA 2021: 154-163 - 2019
- [c20]Fawaz A. Mereani, Jacob M. Howe:
Exact and Approximate Rule Extraction from Neural Networks with Boolean Features. IJCCI 2019: 424-433 - [c19]Edjard Mota, Jacob M. Howe, Ana Schramm, Artur S. d'Avila Garcez:
Efficient Predicate Invention using Shared NeMuS. NeSy@IJCAI 2019 - 2018
- [c18]Fawaz A. Mereani, Jacob M. Howe:
Detecting Cross-Site Scripting Attacks Using Machine Learning. AMLTA 2018: 200-210 - [c17]Fawaz A. Mereani, Jacob M. Howe:
Preventing Cross-Site Scripting Attacks by Combining Classifiers. IJCCI 2018: 135-143 - 2017
- [c16]Edjard de Souza Mota, Jacob M. Howe, Artur S. d'Avila Garcez:
Inductive Learning in Shared Neural Multi-Spaces. NeSy 2017 - [c15]Ana Carolina Melik Schramm, Edjard de Souza Mota, Jacob M. Howe, Artur S. d'Avila Garcez:
Category-based Inductive Learning in Shared NeMuS. NeSy 2017 - [c14]Milena Rodrigues Tenorio, Edjard de Souza Mota, Jacob M. Howe, Artur S. d'Avila Garcez:
Learning about Actions and Events in Shared NeMuS. NeSy 2017 - [c13]Jacob M. Howe, Edward Robbins, Andy King:
Theory learning with symmetry breaking. PPDP 2017: 85-96 - 2013
- [c12]Edward Robbins, Jacob M. Howe, Andy King:
Theory propagation and rational-trees. PPDP 2013: 193-204 - 2012
- [c11]Jacob M. Howe, Andy King:
Polyhedral Analysis Using Parametric Objectives. SAS 2012: 41-57 - 2010
- [c10]Jacob M. Howe, Andy King:
A Pearl on SAT Solving in Prolog. FLOPS 2010: 165-174 - [c9]Jacob M. Howe, Andy King, Charles Lawrence-Jones:
Quadtrees as an Abstract Domain. NSAD@SAS 2010: 89-100 - 2009
- [c8]Philip J. Charles, Jacob M. Howe, Andy King:
Integer Polyhedra for Program Analysis. AAIM 2009: 85-99 - [c7]Jacob M. Howe, Andy King:
Logahedra: A New Weakly Relational Domain. ATVA 2009: 306-320 - 2002
- [c6]Axel Simon, Andy King, Jacob M. Howe:
Two Variables per Linear Inequality as an Abstract Domain. LOPSTR 2002: 71-89 - 2001
- [c5]Jacob M. Howe, Andy King:
Positive Boolean Functions as Multiheaded Clauses. ICLP 2001: 120-134 - 2000
- [c4]Jacob M. Howe, Andy King:
Implementing Groundness Analysis with Definite Boolean Functions. ESOP 2000: 200-214 - 1999
- [c3]Jacob M. Howe, Andy King:
Specialising Finite Domain Programs Using Polyhedra. ECOOP Workshops 1999: 258-259 - [c2]Jacob M. Howe, Andy King:
Specialising Fininte Domain Programs Using Polyhedra. LOPSTR 1999: 118-135 - 1997
- [c1]Jacob M. Howe:
Two Loop Detection Mechanisms: A Comparision. TABLEAUX 1997: 188-200
Parts in Books or Collections
- 2004
- [p1]Jacob M. Howe, Andy King, Lunjin Lu:
Analysing Logic Programs by Reasoning Backwards. Program Development in Computational Logic 2004: 152-188
Informal and Other Publications
- 2020
- [i4]Edward Robbins, Andy King, Jacob M. Howe:
Backjumping is Exception Handling. CoRR abs/2008.04720 (2020) - 2019
- [i3]Edjard Mota, Jacob M. Howe, Ana Schramm, Artur S. d'Avila Garcez:
Efficient predicate invention using shared "NeMuS". CoRR abs/1906.06455 (2019) - 2002
- [i2]Jacob M. Howe, Andy King:
Efficient Groundness Analysis in Prolog. CoRR cs.PL/0201012 (2002) - [i1]Jacob M. Howe, Andy King:
Three Optimisations for Sharing. CoRR cs.PL/0203022 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
