Results 1  10
of
4,628,906
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
Fixed Points in ChainComplete Partial Orders
, 1993
"... This report collects together the basic definitions and theorems about fixed points that are used in the analysis of Verdi. Much of the material here is collected from other reports [3, 4], but there are also some new results needed in the analysis of the Verdi compiler. Most of these results are fa ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
are fairly standard. However, there are a few technical details that are different here. In particular, our definition of chaincompleteness is slightly different that usual, and our basic fixedpoint theorems do not require continuity. 1 Chaincomplete partial orders
A General Extension Theorem for Complete Partial Orders
"... An invocation of Zorn’s Lemma (ZL) often takes place within an indirect proof of a universal statement. Supposing towards a contradiction that there be any counterexample, the maximal counterexample provided by ZL helps—by a “onestep ” argument [1]—to the desired contradiction. Crucially though, th ..."
Abstract
 Add to MetaCart
An invocation of Zorn’s Lemma (ZL) often takes place within an indirect proof of a universal statement. Supposing towards a contradiction that there be any counterexample, the maximal counterexample provided by ZL helps—by a “onestep ” argument [1]—to the desired contradiction. Crucially though, this “one
A Remark About Algebraicity in Complete Partial Orders
"... A characterization theorem for algebraic bounded complete cpos is proved similar to that for algebraic lattices. It is wellknown that a lattice is algebraic iff it isomorphic to a lattice of subalgebras of an algebra. Algebraicity plays the central role in denotational semantics of programming lang ..."
Abstract
 Add to MetaCart
languages, but the structures used there are not exactly algebraic lattices  they are complete algebraic partial orders. In this note I shall characterize such posets as posets of certain subalgebras of partial algebras. Let me recall the definitions (cf. [1]). A poset is called complete (and is usually
Labor Contracts as Partial Gift Exchange
 Quarterly Journal of Economics
, 1982
"... This paper explains involuntary unemployment in terms of the response of firms to workers ' group behavior. Workers ' effort depends upon the norms determining a fair day's work. In order to affect those norms, firms may pay more than the marketclearing wage. Industries that pay cons ..."
Abstract

Cited by 762 (1 self)
 Add to MetaCart
This paper explains involuntary unemployment in terms of the response of firms to workers ' group behavior. Workers ' effort depends upon the norms determining a fair day's work. In order to affect those norms, firms may pay more than the marketclearing wage. Industries that pay
USER’S GUIDE TO VISCOSITY SOLUTIONS OF SECOND ORDER PARTIAL DIFFERENTIAL EQUATIONS
, 1992
"... The notion of viscosity solutions of scalar fully nonlinear partial differential equations of second order provides a framework in which startling comparison and uniqueness theorems, existence theorems, and theorems about continuous dependence may now be proved by very efficient and striking argume ..."
Abstract

Cited by 1403 (15 self)
 Add to MetaCart
The notion of viscosity solutions of scalar fully nonlinear partial differential equations of second order provides a framework in which startling comparison and uniqueness theorems, existence theorems, and theorems about continuous dependence may now be proved by very efficient and striking
A Simple Estimator of Cointegrating Vectors in Higher Order Cointegrated Systems
 ECONOMETRICA
, 1993
"... Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions. T ..."
Abstract

Cited by 507 (3 self)
 Add to MetaCart
Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions
A Singular Value Thresholding Algorithm for Matrix Completion
, 2008
"... This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of reco ..."
Abstract

Cited by 539 (20 self)
 Add to MetaCart
of recovering a large matrix from a small subset of its entries (the famous Netflix problem). Offtheshelf algorithms such as interior point methods are not directly amenable to large problems of this kind with over a million unknown entries. This paper develops a simple firstorder and easy
Time, Clocks, and the Ordering of Events in a Distributed System
, 1978
"... The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering i ..."
Abstract

Cited by 2846 (15 self)
 Add to MetaCart
The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering
Partial Constraint Satisfaction
, 1992
"... . A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem, in particular by satisfying ..."
Abstract

Cited by 469 (21 self)
 Add to MetaCart
. A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem, in particular by satisfying
Results 1  10
of
4,628,906