Graeme S. Port

According to our database, Graeme S. Port authored at least 9 papers between 1986 and 1996.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1996

Requirements for Taking Applications Beyond the Enterprise.

Graeme S. Port, Clifford Heath, Tim Segall, Phillip Merrick

World Wide Web J., 1996

1991

Efficient Bottom-UP Computation of Queries on Stratified Databases.

Isaac Balbin, Graeme S. Port, Kotagiri Ramamohanarao, Krishnamurthy Meenakshi

J. Log. Program., 1991

1989

Stratification and Knowledge Base Management.

Catherine Lassez, Ken McAloon, Graeme S. Port

J. Symb. Comput., 1989

A Fast Algorithm for Melding Splay Trees.

Graeme S. Port, Alistair Moffat

Proceedings of the Algorithms and Data Structures, 1989

1988

A Simple Approach to Finding the Cause of Non-Unifiability.

Graeme S. Port

Proceedings of the Logic Programming, 1988

The NU-Prolog Deductive Database System.

Kotagiri Ramamohanarao, John Shepherd, Isaac Balbin, Graeme S. Port, Lee Naish, James A. Thom, Justin Zobel, Philip W. Dart

Proceedings of the Prolog and Databases, Implementations and New Directions. , 1988

1987

The NU-Prolog Deductive Database System.

Kotagiri Ramamohanarao, John Shepherd, Isaac Balbin, Graeme S. Port, Lee Naish, James A. Thom, Justin Zobel, Philip W. Dart

IEEE Data Eng. Bull., 1987

Stratification and Knowledge Based Management.

Catherine Lassez, Ken McAloon, Graeme S. Port

Proceedings of the Logic Programming, 1987

1986

Maximal Unifiable Subsets and Minimal Nonunifiable Subsets.

T. Y. Chen, Jean-Louis Lassez, Graeme S. Port

New Gener. Comput., 1986