Arrow Research search

Author name cluster

M.J. Maher

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

I&C Journal 1995 Journal Article

Oracle Semantics for Prolog

  • R. Barbuti
  • M. Codish
  • R. Giacobazzi
  • M.J. Maher

This paper proposes to specify semantic definitions for logic programming languages such as Prolog in terms of an oracle which specifies the control strategy and identifies which clauses are to be applied to resolve a given goal. The approach is quite general. It can be applied to Prolog to specify both operational and declarative semantics as well as other logic programming languages. Previous semantic definitions for Prolog typically encode the sequential depth-first search of the language into various mathematical frameworks. Such semantics mimic a Prolog interpreter in the sense that following the "leftmost" infinite path in the computation tree excludes computation to the right of this path from being considered by the semantics. The basic idea in this paper is to abstract away from the sequential control of Prolog and to provide a declarative characterization of the clauses to apply to a given goal. The decision whether or not to apply a clause is viewed as a query to an oracle which is specified from within the semantics and reasoned about from outside. This approach results in simple and concise semantic definitions which are more useful for arguing the correctness of program transformations and providing the basis for abstract interpretations than previous proposals.

TCS Journal 1985 Journal Article

Optimal fixedpoints of logic programs

  • J.-L. Lassez
  • M.J. Maher

From a declarative programming point of view, Manna and Shamir's optimal fixedpoint semantics is more appealing than the least fixedpoint semantics. However in standard formalisms of recursive programming the optimal fixedpoint is not computable while the least fixedpoint is. In the context of logic programming we show that the optimal fixedpoint is equal to the least fixedpoint and is computable. Furthermore the optimal fixedpoint semantics is consistent with Van Emden and Kowalski's semantics of logic programs.

TCS Journal 1984 Journal Article

Closures and fairness in the semantics of programming logic

  • J.-L. Lassez
  • M.J. Maher

We use the notions of closures and fair chaotic iterations to give a semantics to logic programs. The relationships between the semantics of individual rules and the semantics of the whole program are established and an application to parallel processing is mentioned. A chaotic fixed point theorem is given, which carries the non-determinism inherent to resolution. Finally, we introduce a general definition of finite failure and the concept of fair SLD resolution, and show that this procedure is sound and strongly complete with respect to both success and finite failure, thus extending a result of Apt and Van Emden (1982).

v2026.09.13