BibTeX
@MISC{Fitting93metricmethods,
author = {Melvin Fitting},
title = {Metric Methods Three Examples And A Theorem},
year = {1993}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper is to demonstrate their utility and simplicity (when they are applicable). We do this by presenting three examples of programs, and a general theorem, all of which are subject to metric methods. One of these is a direct argument that the game program operator T
Citations
| 1263 | The stable model semantics for logic programming - Gelfond, Lifschitz - 1988 |
| 585 | The Art of Prolog - Sterling, Shapiro - 1986 |
| 570 | Towards a theory of declarative knowledge - Apt, Blair, et al. - 1988 |
| 347 | A Kripke-Kleene Semantics of logic Programs - Fitting - 1985 |
| 205 | Unfounded sets and well-founded semantics for general logic programs - Gelder, Ross, et al. - 1991 |
| 67 | General Topology - Willard - 1970 |
| 49 | Studies in pure Prolog: termination - Apt, Pedreschi - 1990 |
| 46 | Strong termination of logic programs - Bezem - 1993 |
| 43 | Characterising Termination of logic programs with level mappings - Bezem - 1989 |
| 31 | Proving termination of general Prolog programs - APT, PEDRESCHI - 1991 |
| 10 | Topological model set deformations in logic programming - Batarekh, Subrahmanian - 1989 |
| 7 | Completeness Properties for Logic Programs - Cavedon, Consistency - 1989 |
| 4 | Topological Aspects of Logic Programming - Batarekh - 1989 |
| 1 | Acyclic logic programs and the completeness of SLDNFL-resolution - Cavedon - 1991 |
