Griffin is a statically typed language designed specifically for the rapid prototyping of Ada software. In this paper we describe the Griffin language constructs for expressing concurrency. There are two salient innovations: (1) an extended select statement that provides greater flexibility in managing non-deterministic behavior and (2) the capability of a receiving thread to concurrently rendezvous with multiple sending threads. Thus by increasing concurrency, we alleviate the chief drawback to synchronous communication. We then apply the Griffin constructs in implementing solutions to the readers-writers problem, group lock mechanism, and scheduling groups of concurrent operations. The Griffin constructs facilitate the expression of high-level algorithms that maximize concurrency.

An important issue faced by contemporary artificial intelligence workers is how to deal with uncertain information. Four of the more prominent calculi-probability theory (especially the Bayesian approach), the Dempster-Shafer theory, fuzzy set theory, and the MYCIN and EMYCIN calculi-are examined. Particular attention is paid to the underlying assumptions of these calculi and to their computational complexities. Each of the four calculi has a different perspective in uncertainty, and each manipulates uncertain information in a different way. Despite what some authors have claimed, there does not seem to be one calculus that is the best for all situations. Each of the calculi has its strong points; the main disadvantage seen in all of the calculi is that they compute aggregate numbers, but keep no record of divergence in opinions.>

A major event in automated reasoning was the introduction by Robinson of resolution as an inference principle that is complete for the first-order predicate calculus. Here the theory of binary resolution, based strictly on unification, is recast to incorporate the axioms of equality. Equality-based binary resolution is complete without making use of paramodulation and leads to refutations that are less than half as long as standard refutations with the equality axioms. A detailed discussion is given of the first major use of a theorem prover based on this new method.

article Free Access Share on Another Generalization of Resolution Authors: Norman Rubin Polytechnic Institute of New York, 230 Jay Street, Brooklyn, NY and New York University, New York, New York Polytechnic Institute of New York, 230 Jay Street, Brooklyn, NY and New York University, New York, New YorkView Profile , Malcolm C. Harrison Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NYView Profile Authors Info & Claims Journal of the ACMVolume 25Issue 3July 1978 pp 341–351https://doi.org/10.1145/322077.322078Published:01 July 1978Publication History 12citation294DownloadsMetricsTotal Citations12Total Downloads294Last 12 Months3Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF