MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Grounding with Bounds." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

23 documents found, showing 1 through 10. Next 10 →

ATOM

Optimization of Mercury programs
by Simon Taylor, Supervisor Dr. Zoltan Somogyi — 1998
… the uniqueness, with `shared' written as `ground'. bound(!uniqueness?, !functor?, !args?) Bound to !functor…
Cited by 4 (0 self) – Add To MetaCart

Stable Running in a Quadruped Robot with Compliant Legs
by Didier Papadopoulos, Martin Buehler — 2000 — IEEE Int. Conf. Robotics and Automation
… between toe and ground, bounding easily fails due to slipping during stance. For this reason, control…
Cited by 25 (10 self) – Add To MetaCart

Binding Energy of the
by Donorconfined Lo Phonon
…±confined LO phonon interactions on the ground bound state of a shallow donor impurity located on the axis…
Add To MetaCart

Improving abstract interpretations by combining domains
by Michael Codish, Anne Mu Lkers, Maurice Bruynooghe, De La Banda, Manuel Hermenegildo — 1995 — ACM Transactions on Programming Languages and Systems
… variable is ground if it is bound to a term t such that vars(t) = 0. A program variable is linear…
Cited by 46 (13 self) – Add To MetaCart

Making Mercury Programs Tail Recursive
by Peter Ross, David Overton, Zoltan Somogyi — 1999 — In Procs. of LOPSTR99, LNCS 1817
… ground(uniqueness) is bound to a ground term whose structure is unknown. The uniqueness eld describes…
Cited by 4 (3 self) – Add To MetaCart

An Algebraic Approach to Sharing Analysis of Logic Programs
by Michael Codish, Vitaly Lagoon, Francisco Bueno — 1997 — Journal of Logic Programming
… they are bound to terms which contain a common variable. A variable in a logic program is said to be ground…
Cited by 12 (7 self) – Add To MetaCart

Precise Pair-Sharing Analysis of Logic Programs
by Vitaly Lagoon And, Vitaly Lagoon, Peter J. Stuckey — 2002 — In Proc. of the 4th international ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP
… to be ground if it is bound to a ground term in every execution of the program. A variable is said to be linear…
Add To MetaCart

Enhanced Sharing Analysis Techniques: A Comprehensive Evaluation
by Roberto Bagnara, Enea Zaffanella, Patricia M. Hill — 2000
… to a non-variable term, it is ground if it is bound to a term containing no variables, it is free…
Cited by 6 (5 self) – Add To MetaCart

BSP Constraint Programming
by Olivier Ballereau, Gaétan Hains, Arnaud Lallouet — 2000
… for the rule to be applicable, L must be ground and bound to an integer vector. The non-ground case…
Add To MetaCart

Animal Spirits, Lumpy Investment and
by Endogenous Business Cycles, Giovanni Dosi, Giorgio Fagioloº, Andrea Roventini, Giovanni Dosi, Giorgio Fagiolo, Andrea Roventini — 2005
… market uncertainty, so that investment and pricing decisions are taken on the grounds of boundedly…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB