Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Jacob M. Howe"'
Autor:
Jacob M. Howe, Fawaz A. Mereani
Publikováno v:
Computational Intelligence
Studies in Computational Intelligence ISBN: 9783030705930
Studies in Computational Intelligence ISBN: 9783030705930
Explainable artificial intelligence (XAI) is concerned with creating artificial intelligence that is intelligible and interpretable by humans. Many AI techniques build classifiers, some of which result in intelligible models, some of which don’t. R
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b27cf5c18a403851dfc553cd15240063
https://openaccess.city.ac.uk/id/eprint/25760/1/RuleExtractionLong.pdf
https://openaccess.city.ac.uk/id/eprint/25760/1/RuleExtractionLong.pdf
Publikováno v:
Theoretical Computer Science. 768:1-42
Subclasses of linear inequalities where each inequality has at most two vari- ables are popular in abstract interpretation and model checking, because they strike a balance between what can be described and what can be efficiently computed. This pape
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1a64a47e5360b55fdbdcafcac693ad9
https://doi.org/10.1016/j.tcs.2018.12.001
https://doi.org/10.1016/j.tcs.2018.12.001
Autor:
Jacob M. Howe, Wadha S. N. Alhamdan
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030697167
AMLTA
AMLTA
This paper explores the use of Convolutional Neural Networks in classifying images of date fruits as one of 9 varieties, creating several models with the highest achieving 97% accuracy. It contributes an original dataset of 1658 high-quality images t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::48eae128e8e458707c66d27f1c6ebb55
https://doi.org/10.1007/978-3-030-69717-4_16
https://doi.org/10.1007/978-3-030-69717-4_16
ISO Prolog provides catch and throw to realize the control flow of exception handling. This pearl demonstrates that catch and throw are inconspicuously amenable to the implementation of backjumping. In fact, they have precisely the semantics required
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffa7dff7563d0ea4941bb67c925bbbd9
https://kar.kent.ac.uk/82447/7/div-class-title-backjumping-is-exception-handling-div.pdf
https://kar.kent.ac.uk/82447/7/div-class-title-backjumping-is-exception-handling-div.pdf
Autor:
Jacob M. Howe, Fawaz A. Mereani
Publikováno v:
IJCCI
Rule extraction from classifiers treated as black boxes is an important topic in explainable artificial intelligence (XAI). It is concerned with finding rules that describe classifiers and that are understandable to humans, having the form of (I f...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3fad3af26e5abccf214005721753397
https://doi.org/10.5220/0008362904240433
https://doi.org/10.5220/0008362904240433
Autor:
Jacob M. Howe, Fawaz A. Mereani
Publikováno v:
The International Conference on Advanced Machine Learning Technologies and Applications (AMLTA2018) ISBN: 9783319746890
AMLTA
AMLTA
Cross-site scripting (XSS) is one of the most frequently occurring types of attacks on web applications, hence is of importance in information security. XSS is where the attacker injects malicious code, typically JavaScript, into the web application
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d4e11999dc5feee6c2a39515dbc9f61
https://doi.org/10.1007/978-3-319-74690-6_20
https://doi.org/10.1007/978-3-319-74690-6_20
Publikováno v:
PPDP
Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming
Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming
This paper investigates the use of a Prolog coded SMT solver in tackling a well known constraints problem, namely packing a given set of consecutive squares into a given rectangle, and details the developments in the solver that this motivates. The p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5fc2afce14f29ac32052307b02d1c14b
https://doi.org/10.1145/3131851.3131861
https://doi.org/10.1145/3131851.3131861
SAT Modulo Theories (SMT) is the problem of determining the satisfiability of a formula in which constraints, drawn from a given constraint theory T, are composed with logical connectives. The DPLL(T) approach to SMT has risen to prominence as a tech
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72f84f52b39428e6b9be2a02189246be
https://kar.kent.ac.uk/37600/1/main.pdf
https://kar.kent.ac.uk/37600/1/main.pdf
Autor:
Andy King, Jacob M. Howe
Publikováno v:
Theory and Practice of Logic Programming. 3:243-257
In order to improve precision and efficiency sharing analysis should track both freeness and linearity. The abstract unification algorithms for these combined domains are suboptimal, hence there is scope for improving precision. This paper proposes t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::851e86c35581eaf8ab1b9822fab02186
https://doi.org/10.1017/s1471068402001497
https://doi.org/10.1017/s1471068402001497
Autor:
Andy King, Jacob M. Howe
Publikováno v:
Theory and Practice of Logic Programming
Boolean functions can be used to express the groundness of, and trace grounding dependencies between, program variables in (constraint) logic programs. In this paper, a variety of issues pertaining to the efficient Prolog implementation of groundness
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a501002b7b841f5f93ac5c82553ca09e
https://doi.org/10.1017/s1471068402001485
https://doi.org/10.1017/s1471068402001485