Not enough data to create a plot.
Try a different view from the menu above.
Information Technology
The semantics of predicate logic as a programming language
Sentences in first-order predicate logic can be usefully interpreted as programs. In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated. It is concluded that operational semantics is a part of proof theory and that fixpoint semantics is a special case of model-theoretic semantics.
A Mathematical Theory of Evidence
In the spring of 1971, I attended a course on statistical inference taught by Arthur Dempster at Harvard. In the fall of that same year Geoffrey Watson suggested I give a talk expositing Dempster's work on upper and lower probabilities to the Department of Statistics at Princeton. This essay is one of the results of the ensuing effort. It offers a reinterpretation of Dempster's work, a reinterpretation that identifies his "lower probabilities" as epistemic probabilities or degrees of belief, takes the rule for combining such degrees of belief as fundamental, and abandons the idea that they arise as lower bounds over classes of Bayesian probabilities.
Conceptual Graphs for a Data Base Interface
Abstract: A data base system that supports natural language queries is not really natural if it requires the user to know how the data are represented. This paper defines a formalism, called conceptual graphs, that can describe data according to the user’s view and access data according to the system’s view. In addition, the graphs can represent functional dependencies in the data base and support inferences and computations that are not explicit in the initial query.IBM Journal of Research and Development 20:4, pp. 336-357.