Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Hill, Pat"'
Autor:
Tinker, Amanda, Hill, Pat
Publikováno v:
11th ALDinHE Conference: Learning Development Spaces and Places
Following on from work done on integrating learning development into the curriculum (Hill and Tinker, 2013), we have since concentrated on specific aspects of student progression, and in particular how the ‘forgotten’ second year of study (Tobolo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=core_ac_uk__::d95f4c5753518f8473e6b2511356de4f
https://eprints.hud.ac.uk/id/eprint/25005/1/5-2a-v2.pdf
https://eprints.hud.ac.uk/id/eprint/25005/1/5-2a-v2.pdf
Engagement with Continued Professional Development (CPD) e-portfolios has been shown to\ud improve graduate employability, but when e-portfolios are un-assessed they traditionally lack student commitment. This research proposes to identify and analys
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=core_ac_uk__::8f6c7b1be03b50c884b606f5ac17cc69
https://eprints.hud.ac.uk/id/eprint/19368/2/abdullah.pdf
https://eprints.hud.ac.uk/id/eprint/19368/2/abdullah.pdf
Publikováno v:
Research in Post-Compulsory Education; Sep2017, Vol. 22 Issue 3, p334-354, 21p
interpretation theory has successfully been used for constructing algorithms to statically determine run-time properties of programs. Central is the notion of an abstract domain, describing certain properties of interest about the program. In logic p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=core_ac_uk__::d9baaf90ea7b5f6cb649eda4cc75c311
https://kar.kent.ac.uk/37619/1/content.pdf
https://kar.kent.ac.uk/37619/1/content.pdf
Def, the domain of definite Boolean functions, expresses (sure) dependencies between the program variables of, say, a constraint program. Share, on the other hand, captures the (possible) variable sharing between the variables of a logic program. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=core_ac_uk__::c04c35bd2638952d2a7070c8566ffe68
https://kar.kent.ac.uk/37618/1/content.pdf
https://kar.kent.ac.uk/37618/1/content.pdf
We present verification methods for logic programs with delay declarations, showing how type and instantiation errors related to built-ins can be avoided, and how termination can be ensured. Three features are distinctive of this work: (a) we assume
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=core_ac_uk__::b64b353f93f33de050b147f2ebdc9fb9
https://kar.kent.ac.uk/21649/1/Preventing_Instantiation_Errors_and_Loops_for_Logic_Programs_with_Several_Modes_Using_t_block_Declarations.pdf
https://kar.kent.ac.uk/21649/1/Preventing_Instantiation_Errors_and_Loops_for_Logic_Programs_with_Several_Modes_Using_t_block_Declarations.pdf
Autor:
Hill, Pat, King, Andy
One unique feature of logic languages is their ability to succinctly and declaratively express non-determinacy and hence search. Improving search efficiency is one of the main goals of AI and, by studying how redundant search may be factored out, thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=core_ac_uk__::a11ec3238ab1087f81c5e02896a9f6f9
https://kar.kent.ac.uk/37586/1/content.pdf
https://kar.kent.ac.uk/37586/1/content.pdf
Autor:
Ervin, Bonnie, Callahan, Sandy, Rauschenberger, Heather, Patterson, Richard, Jackson, Julia, DeValeria, Jeanne, Plumb, George1, Lemire, Celeste, Ford, Stephanie, Biddle, Dan, McFarland, Courtney, Rombough, Lori, Irvin, Sariann, Hill, Pat, Denning, Courtney
Publikováno v:
Mother Earth News. Apr/May2015, Issue 269, p7-98. 8p.
Autor:
Goos, Gerhard, Hartmanis, Juris, Leeuwen, Jan, Palamidessi, Catuscia, Glaser, Hugh, Meinke, Karl, Smaus, Jan-Georg, Hill, Pat, King, Andy
Publikováno v:
Principles of Declarative Programming; 1998, p73-88, 16p