#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1973

2005

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Y. Edmund Lien
- J. ACM
- 1982

All eqmvalence is estabhshed between network databases and a subclass of relational databases. A database is a set of files together w~th a set of constraints that the fdes must satisfy. The constraints are spectfied by Bachman diagrams m the network model and by data dependencies m the relational model. The subclass of relatmnal databases of interest ~s… (More)

- Neil D. Jones, Lawrence H. Landweber, Y. Edmund Lien
- Theor. Comput. Sci.
- 1977

We consider the complexity of several steindard problems for various classes of Pletri nets.. In particular, the reachability problem, the liveness problem and the k-‘boundedness problems are analyzed. Some polynomial time and polynomial space complete probkms for Petri nets are given. We then show that the problem of deciding whether a Petri net Is… (More)

- Ignacio Esponday, Luís Cabral, Vincent P. Crawford, Willie Fuchs, William Greene, Y. Edmund Lien
- 2005

I propose a new solution conceptbehavioral equilibriumto study environments with players who are naive, in the sense that they fail to account for the informational content of other playersactions. A behavioral equilibrium requires that: (i) players have no incentives to deviate given their beliefs about the consequences of deviating; (ii) these beliefs… (More)

- Neil D. Jones, Y. Edmund Lien, William T. Laaser
- Mathematical systems theory
- 1976

It is shown that a variety of problems have computational complexity equivalent to that of finding a path through a directed graph. These results, which parallel those of Karp at a lower complexity level, concern satisfiability of propositional formulas with two literals per clause, generation of elements by an associative binary operation, solution of… (More)

- Y. Edmund Lien
- SIAM J. Comput.
- 1976

- Y. Edmund Lien
- ACM Trans. Database Syst.
- 1981

Most database design methods for the relational model produce a flat database, that is, a family of relations with no explicit interrelational connections. The user of a flat database is likely to be unaware of certain interrelational semantics. In contrast, the entity-relationship model provides schema graphs as a description of the database, as well as… (More)

- Kung-Chao Chu, John P. Fishburn, Peter Honeyman, Y. Edmund Lien
- Engineering Design Applications
- 1983

- Y. Edmund Lien
- Fifth International Conference on Very Large Data…
- 1979

The role of null values in a relational data base is considered within the framework of multivalued dependencies. When a relation contains null values, a different treatment of data dependencies and different relational operations such as projection and join, are necessary. This paper develops a complete axiomatization for the revised multivalued… (More)

- Y. Edmund Lien, John H. Ying
- COMPSAC
- 1978

- Y. Edmund Lien
- ER
- 1979