Results 1  10
of
18,799
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
UCPOP: A Sound, Complete, Partial Order Planner for ADL
, 1992
"... We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional effects, universally quantified preconditions and effects, and with universally quantified goals. We prove ucpo ..."
Abstract

Cited by 491 (24 self)
 Add to MetaCart
We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional effects, universally quantified preconditions and effects, and with universally quantified goals. We prove ucpop is both sound and complete for this representation and describe a practical implementation that succeeds on all of Pednault's and McDermott's examples, including the infamous "Yale Stacking Problem" [McDermott 1991].
GromovWitten classes, quantum cohomology, and enumerative geometry
 Commun. Math. Phys
, 1994
"... The paper is devoted to the mathematical aspects of topological quantum field theory and its applications to enumerative problems of algebraic geometry. In particular, it contains an axiomatic treatment of Gromov–Witten classes, and a discussion of their properties for Fano varieties. Cohomological ..."
Abstract

Cited by 484 (3 self)
 Add to MetaCart
The paper is devoted to the mathematical aspects of topological quantum field theory and its applications to enumerative problems of algebraic geometry. In particular, it contains an axiomatic treatment of Gromov–Witten classes, and a discussion of their properties for Fano varieties. Cohomological Field Theories are defined, and it is proved that tree level theories are determined by their correlation functions. Application to counting rational curves on del Pezzo surfaces and projective spaces are given. Let V be a projective algebraic manifold. Methods of quantum field theory recently led to a prediction of some numerical characteristics of the space of algebraic curves in V, especially of genus zero, eventually endowed with a parametrization and marked points. It turned out that
Dual polyhedra and mirror symmetry for Calabi–Yau hypersurfaces in toric varieties
 J. Alg. Geom
, 1994
"... We consider families F(∆) consisting of complex (n − 1)dimensional projective algebraic compactifications of ∆regular affine hypersurfaces Zf defined by Laurent polynomials f with a fixed ndimensional Newton polyhedron ∆ in ndimensional algebraic torus T = (C ∗ ) n. If the family F(∆) defined by ..."
Abstract

Cited by 467 (20 self)
 Add to MetaCart
We consider families F(∆) consisting of complex (n − 1)dimensional projective algebraic compactifications of ∆regular affine hypersurfaces Zf defined by Laurent polynomials f with a fixed ndimensional Newton polyhedron ∆ in ndimensional algebraic torus T = (C ∗ ) n. If the family F(∆) defined by a Newton polyhedron ∆ consists of (n − 1)dimensional CalabiYau varieties then the dual, or polar, polyhedron ∆ ∗ in the dual space defines another family F( ∆ ∗ ) of CalabiYau varieties, so that we obtain the remarkable duality between two different families of CalabiYau varieties. It is shown that the properties of this duality coincide with the properties of Mirror Symmetry discovered by physicists for CalabiYau 3folds. Our method allows to construct many new examples of CalabiYau 3folds and new candidates for their mirrors which were previously unknown for physicists. We conjecture that there exists an isomorphism between two conformal field theories corresponding to CalabiYau varieties from two families F(∆) and F( ∆ ∗). 1
ControlFlow Analysis of HigherOrder Languages
, 1991
"... representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: dataflow analysis, Scheme, LISP, ML, CPS, type recovery, higherorder functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful, ..."
Abstract

Cited by 362 (10 self)
 Add to MetaCart
, higherorder languages like Scheme, ML, and Common Lisp should run as fast as their FORTRAN and C counterparts. They should, but they don’t. A major reason is the level of optimisation applied to these two classes of languages. Many FORTRAN and C compilers employ an arsenal of sophisticated global
Analogical Mapping by Constraint Satisfaction
 COGNITIVE SCIENCE 13, 295 (1989)
, 1989
"... A theory of analogical mopping between source and target analogs based upon interacting structural, semantic, and pragmatic constraints is proposed here. The structural constraint of fsomorphfsm encourages mappings that maximize the consistency of relational corresondences between the elements of th ..."
Abstract

Cited by 389 (28 self)
 Add to MetaCart
A theory of analogical mopping between source and target analogs based upon interacting structural, semantic, and pragmatic constraints is proposed here. The structural constraint of fsomorphfsm encourages mappings that maximize the consistency of relational corresondences between the elements of the two analogs. The constraint of semantic similarity supports mapping hypotheses to the degree that mapped predicates have similar meanings. The constraint of pragmatic centrality fovors mappings involving elements the analogist believes to be important in order to achieve the purpose for which the anology Is being used. The theory is implemented in a computer progrom called ACME (Analogical Constraint Mapping Engine), which represents constraints by means of a network of supporting and competing hypotheses regarding what elements to map. A coop erative algorithm for parallel constraint satisfaction identifies mapping hypotheses that collectively represent the overall mapping that best fits the interactlng constraints. ACME has been applied to a wide range of examples that include problem analogies, analogical arguments, explanatory analogies, story analogies, formal analogies, and metaphors. ACME is sensitive to semantic and prag matic information if it is available,.and yet able to compute mappings between formally isomorphic analogs without any similar or identical elements. The theory Is able to account for empirical findings regarding the impact of consistenty and similarity on human processing of analogies.
Results 1  10
of
18,799