Search in concurrent logic languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Search in concurrent logic languages

Full text

Pdf (952 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1995 ACM symposium on Applied computing table of contents

Nashville, Tennessee, United States

Pages: 164 - 170

Year of Publication: 1995

ISBN:0-89791-658-1

Author

Matthew Huntbach

Department of Computer Science, Queen Mary and Westfield College, University of London

Sponsors

SIGBIO: ACM Special Interest Group on Biomedical Computing
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGICE: ACM Special Interest Group on Individual Computing Environment
SIGAPP: ACM Special Interest Group on Applied Computing
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 10, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/315891.315947 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Henri E. Bal, Evaluation of KL1 and the inference machine, Future Generation Computer Systems, v.9 n.2, p.119-125, July 1993
	2	F. W. Burton, Nondeterminism with referential transparency in functional programming languages, The Computer Journal, v.31 n.3, p.243-247, June 1988 [doi>10.1093/comjnl/31.3.243]
	3	K.L.Clark and S.Gregory. Parlog and Prolog united, in 4th Int. Conf. on Log. Prog., pp.927-961. 1987.
	4	K.L.Clark and S-3..T'/rnlund. A first order theory of data and programs, in Information Processing 77: Proc. IFIP Congress 77, pp.939-944. 1977.
	5	Michael Codish , Ehud Shapiro, Compiling OR-parallelism into AND-parallelism, Proceedings on Third international conference on logic programming, p.283-297, September 1986, London, United Kingdom
	6	D.Cohen, M.Huntbach and G.Ringwood. Logical Occam. In Implementations of Distributed Prolog, P.Kacsuk and M.J.Wise (eds), Wiley. 1992.
	7	A.Colmerauer, H.Kanoui, R.Pasero and P.Roussel. Un Systbme de Communications Homme-Machine en Fran~ais, Rapport preliminaire, Groupe de Research en Intelligence Artificielle, Universit6 d'Aix-Marseille, Luminy. 1972.
	8	Alain Colmerauer , Philippe Roussel, The birth of Prolog, ACM SIGPLAN Notices, v.28 n.3, p.37-52, March 1993
	9	M.J.Coombs, R.T. Hartley and J.G.Ste!!. Debugging user conceptions of interpretation processes. In Proc. AAAI-86 Conf., pp.303-307. 1986.
	10	M.Dowson. A note .on Micro-PLANNER. In Implementations of Prolog, J.A.Campbell (ed), Ellis Horwood. 1984.
	11	Ian Foster , Stephen Taylor, Strand: new concepts in parallel programming, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989
	12	Steve Gregory, Experiments with speculative parallelism in Parlog, Proceedings of the 1993 international symposium on Logic programming, p.370-387, December 1993, Vancouver, British Columbia, Canada
	13	Dale H. Grit , Rex L. Page, Deleting Irrelevant Tasks in an Expression-Oriented Multiprocessor System, ACM Transactions on Programming Languages and Systems (TOPLAS), v.3 n.1, p.49-59, Jan. 1981 [doi>10.1145/357121.357125]
	14	Steven Hardy, Towards more natural programming languages, Artificial intelligence programming environments, John Wiley & Sons, Inc., New York, NY, 1987
	15	S. Haridi, A logic programming language based on the Andorra model, New Generation Computing, v.7 n.2-3, p.109-125, 1990 [doi>10.1007/BF03037202]
	16	M.Huntbach. Parallel Branch and Bound Search in Parlog. Int. J. of Parallel Programming 20,4 1991 pp.299- 314. 1991.
	17	Matthew M. Huntbach , Graem A. Ringwood, Programming In Concurrent Logic Languages, IEEE Software, v.12 n.6, p.71-81, November 1995 [doi>10.1109/52.469762]
	18	Robert A. Kowalski, The early years of logic programming, Communications of the ACM, v.31 n.1, p.38-43, Jan. 1988 [doi>10.1145/35043.35046]
	19	Ten-Hwang Lai , Sartaj Sahni, Anomalies in parallel branch-and-bound algorithms, Communications of the ACM, v.27 n.6, p.594-602, June 1984 [doi>10.1145/358080.358103]
	20	E.Lawler and D.Wood. Branch-and-bound methods: a survey. Oper. Res. 14, pp.699-719. 1966.
	21	D L McBurney , M R Sleep, Transputer-based experiments with the ZAPP architecture, Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe, p.242-259, March 1987, Eindhoven, The Netherlands
	22	$.McCarthy. A basis for the mathematical theory of computation. In Computer Programming and Formal Systems, P. Brafford and D. Hirschberg (eds), North-Holland, pp.33-70. 1963.
	23	G.A.Ringwood. A comparative exploration of concurrent logic languages. Knowledge Engineering Review 4, 4 pp.305-332. 1989.
	24	Vijay A. Saraswat , Ken Kahn , Jacob Levy, Janus: a step towards distributed constraint programming, Proceedings of the 1990 North American conference on Logic programming, p.431-446, January 1990, Austin, Texas, United States
	25	E. Shapiro, A subset of Concurrent Prolog and its interpreter, Concurrent Prolog, MIT Press, Cambridge, MA, 1988
	26	Ehud Shapiro, The family of concurrent logic programming languages, ACM Computing Surveys (CSUR), v.21 n.3, p.413-510, Sep. 1989 [doi>10.1145/72551.72555]
	27	E.$hapiro and A.Takeuchi. Object oriented programming in Concurrent Prolog. New Generation Computing 1, I pp.25-48. 1983.
	28	Ehud Shapiro , David H. D. Warren, Personal perspectives, Communications of the ACM, v.36 n.3, p.46-49, March 1993 [doi>10.1145/153520.153534]
	29	G.J.Sussman and D.V.McDermott. From PLANNER to CONNIVER - a genetic approach. In Proc. AFIPS Fall Conference, pp. 117 I- 1179. 1972.
	30	Péter Szeredi, Solving Optimisation Problems in the Aurora Or-parallel Prolog System, Pre-Conference Workshop on Parallel Execution of Logic Programs, p.39-53, June 24, 1991
	31	Josephine Annette Taylor, Programming in prolog: an indepth study of problems for beginners learning to program in prolog, 1988
	32	Evan Tick, Parallel logic programming, MIT Press, Cambridge, MA, 1991
	33	Kazunori Ueda, Making exhaustive search programs deterministic, Proceedings on Third international conference on logic programming, p.270-282, September 1986, London, United Kingdom
	34	K. Ueda , T. C. Chikayama, Design of the kernel language for the parallel inference machine, The Computer Journal, v.33 n.6, p.494-500, Dec. 1990 [doi>10.1093/comjnl/33.6.494]
	35	Frank Van Harmelen, Meta-Level Inference Systems, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991
	36	Rong Yang , Hideo Aiso, P-Prolog: a parallel logic programming language based on exclusive relation, Proceedings on Third international conference on logic programming, p.255-269, September 1986, London, United Kingdom
	37	E. Yardeni , S. Kliger , K. Kahn , E. Shapiro, The languages FCP(:) and FCP(:,?), New Generation Computing, v.7 n.2-3, p.89-107, 1990 [doi>10.1007/BF03037201]