Showing papers by "Michael J. Maher published in 1986"
01 Sep 1986
TL;DR: In this article, identical equivalences based upon functional semantics [P] and logical consequences of P allow the application of two different and powerful tools to reason about programs, in particular, these equivalences seem ideal for discussing the deductive structure of such deductive databases.
Abstract: For applications such as deductive databases employing the Open World Assumption, failed derivations have a lesser importance. In this case, use of the identical equivalences based upon the functional semantics [P] and the logical consequences of P allows the application of two different and powerful tools to reason about programs. In particular, these equivalences seem ideal for discussing the deductive structure of such deductive databases, independent of any particular state of the database of facts.
31 citations
Proceedings Article•
14 Jul 1986
TL;DR: In this article, a user-oriented formalism for the Herbrand universe is proposed, where the objects in this formalism are the uninterpreted terms over the herbrand universe.
Abstract: The simplicity and elegance of definite clauses makes this formalism attractive from a theoretical point of view. The objects in this formalism are the uninterpreted terms over the Herbrand universe. Programming however is not done exclusively in the Herbrand universe, but uses higher level concepts such as arithmetic. In that sense we can view definite clauses as the Turing machines of Logic Programming. This gap between theory and programming practice can be reduced by introducing user-oriented domains into the formalism. We have seen that this can be achieved without losing the important properties of definite clauses.
29 citations
IBM1
TL;DR: This work has seen that the gap between theory and programming practice can be reduced by introducing user-oriented domains into the formalism, and can be achieved without losing the important properties of definite clauses.
Abstract: The simplicity and elegance of definite clauses makes this formalism attractive from a theoretical point of view. The objects in this formalism are the uninterpreted terms over the Herbrand universe. Programming however is not done exclusively in the Herbrand universe, but uses higher level concepts such as arithmetic. In that sense we can view definite clauses as the Turing machines of Logic Programming. This gap between theory and programming practice can be reduced by introducing user-oriented domains into the formalism. We have seen that this can be achieved without losing the important properties of definite clauses.
27 citations
TL;DR: The main purpose of this paper is to point out major errors in the proof of the theorem on the soundness and completeness of the negation-as-failure rule.
Abstract: The paper [1] purports to present a classification of the general failure sets of logic programs and a simple proof of the theorem on the soundness and completeness of the negation-as-failure rule In this note we clarify some conflicting terminology between [1] and the papers [2, 3] to which it predominantly refers Our main purpose, however, is to point out major errors, in particular, one in the proof of the above mentioned theorem
8 citations
Proceedings Article•
14 Jul 1986
TL;DR: For applications such as deductive databases employing the Open World Assumption, failed derivations have a lesser importance, and use of the identical equivalences based upon the functional semantics [P] and the logical consequences of P allows the application of two different and powerful tools to reason about programs.
3 citations