On the existence of nonterminating queries for a restricted class of PROLOG-clauses

, &
Artificial Intelligence 41 (2):237-248 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(89)90012-x

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,813

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Pac-learning non-recursive prolog clauses.William W. Cohen - 1995 - Artificial Intelligence 79 (1):1-38.
Approximating Self-Saturation for Inductively Learning Recursive Clauses.Ana Oliveira - 1995
On the expressibility and the computability of untyped queries.Jose Turull Torres - 2001 - Annals of Pure and Applied Logic 108 (1-3):345-371.
On the expressibility and the computability of untyped queries.Jose Maria Turull Torres - 2001 - Annals of Pure and Applied Logic 108 (1-3):345-371.
N-prolog and equivalence of logic programs.Nicola Olivetti & Lea Terracini - 1992 - Journal of Logic, Language and Information 1 (4):253-340.
Ceteris paribus clauses, closure clauses and falsifiability.Ingvar Johansson - 1980 - Zeitschrift Für Allgemeine Wissenschaftstheorie 11 (1):16-22.
Negation As Refutation.Melvin Fitting - unknown
The Implementation of Prolog.Patrice Boizumault - 2014 - Princeton Legacy Library.
On the Commutativity of Jumps.Timothy Mcnicholl - 2000 - Journal of Symbolic Logic 65 (4):1725-1748.
On the commutativity of jumps.Timothy H. McNicholl - 2000 - Journal of Symbolic Logic 65 (4):1725-1748.
Aspects of a Graph-Based Proof Procedure for Horn Clauses.Stan T. Raatz - 1987 - Dissertation, University of Pennsylvania
A Prolog Implementation of the Method of Euler Circles for Syllogistic Reasoning.Peter Yule - 1996 - Hcrc Publications, University of Edinburgh.
A Theory Of Local Set Queries.Klaus-Dieter Schewe & José María Turull Torres - 2005 - Logic Journal of the IGPL 13 (1):47-68.
A general condition for collapse results.Michael A. Taitslin - 2001 - Annals of Pure and Applied Logic 113 (1-3):323-330.
Mints type deductive calculi for logic programming.J. C. Shepherdson - 1992 - Annals of Pure and Applied Logic 56 (1-3):7-17.

Analytics

Added to PP
2020-12-22

Downloads
6 (#1,478,913)

6 months
6 (#579,310)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references