Results 21 to 30 of about 400,378 (126)
Ecological modelling of a wetland for phytoremediating Cu, Zn and Mn in a gold–copper mine site using Typha domingensis (Poales: Typhaceae) near Orange, NSW, Australia [PDF]
, 2017 : An artificial wetland was computationally modelled using STELLA®, a graphical programming tool for an Au–Cu mine site in Central-west NSW, the aim of which was to offer a predictive analysis of a proposed wetland for Cu, Zn and Mn removal ...
Adams, Allan +4 more
core +2 more sources
Offline Specialisation in Prolog Using a Hand-Written Compiler Generator
, 2004 The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evaluation of both functional and imperative languages.
Bruynooghe, Maurice +3 more
core +1 more source
Classes of Terminating Logic Programs
, 2002 Termination of logic programs depends critically on the selection rule, i.e. the rule that determines which atom is selected in each resolution step.
Pedreschi, Dino +2 more
core +2 more sources
Foundation to Promote Scholarship and Teaching 2012-2013 Awards [PDF]
, 2013 Proposal abstracts of 2012-2013 award recipients in a wide range of disciplinary ...
Office of the Provost, Roger Williams University
core +1 more source
Youth Violence Myths and Realities: A Tale of Three Cities [PDF]
, 2009 A study of media coverage of youth violence, actual crime data, and interviews with committed youth and the professionals that work with ...
Angela Wolf +3 more
core
Singular and Plural Functions for Functional Logic Programming
, 2012 Functional logic programming (FLP) languages use non-terminating and non-confluent constructor systems (CS's) as programs in order to define non-strict non-determi-nistic functions.
ADRIÁN RIESCO +35 more
core +1 more source
, 2004 Taylor introduced a variable binding scheme for logic variables in his PARMA system, that uses cycles of bindings rather than the linear chains of bindings used in the standard WAM representation.
Bart Demoen +4 more
core +2 more sources
Understanding the Internet: Model, Metaphor, and Analogy [PDF]
, 2001 published or submitted for ...
McFadden, Thomas G.
core
Transforming floundering into success
, 2012 We show how logic programs with "delays" can be transformed to programs without delays in a way which preserves information concerning floundering (also known as deadlock).
Apt +15 more
core +1 more source
On the Effective Configuration of Planning Domain Models [PDF]
, 2015 The development of domain-independent planners within the AI Planning community is leading to “off the shelf” technology that can be used in a wide range of applications.
Chrpa, Lukáš +3 more
core