• Cite Icon4
  • https://doi.org/10.1007/bf01536404Copy DOI Icon

On computability by logic programs

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The problem of computational completeness of Horn clause logic programs is revisited. The standard results on representability of all computable predicates by Horn clause logic programs are not related to the real universe on which logic programs operate. SLD-resolution, which is the main mechanism to execute logic programs, may give answer substitutions with variables. As the main result we prove that computability by Horn clause logic programs is equivalent to standard computability over the Herbrand universe with variables. The semantics we use isS-semantics introduced by Falaschi et al. [3]. As an application of the main result we prove the existence of a metainterpreter for a sublanguage of real Prolog, written in the language of Horn clauses with the S-semantics. We also show that the traditional semantics of Prolog do not reflect its computational behavior from the viewpoint of recursion theory.

Similar Papers
  • PDF
  • Journal Issue

Proceedings of the First Workshop on Coalgebra, Horn Clause Logic Programming and Types

  • Sep 13, 2017
  • Electronic Proceedings in Theoretical Computer Science
  • Ekaterina Komendantskaya +1
  • Research Article
  • Citations15

High-level Petri net model of logic program with negation

  • Jun 01, 1994
  • IEEE Transactions on Knowledge and Data Engineering
  • Liwu Li
  • Book Chapter
  • Citations5

Our LIPS are sealed: Interfacing functional and logic programming systems

  • Aug 26, 1992
  • Gary Lindstrom +2
  • Book Chapter
  • Citations23

Procedural interpretation of non-horn logic programs

  • Nov 23, 2005
  • Jack Minker +1
  • Book Chapter
  • Citations23

Complexity of query answering in logic databases with complex values

  • Jan 01, 1997
  • Evgeny Dantsin +1
  • Book Chapter
  • Citations15

Negation as Failure, Completion and Stratification

  • Jan 08, 1998
  • J C Shepherdson
  • Research Article
  • Citations22

An execution model for exploiting AND-parallelism in logic programs

  • Mar 01, 1988
  • New Generation Computing
  • Yow-Jian Lin +1
  • Research Article
  • Citations2

Suprema of Open and Closed Formulas and Their Application to Resolution

  • Feb 01, 1995
  • Information and Computation
  • M Bellia +1
  • Research Article
  • Citations21

A high-level Petri net for goal-directed semantics of Horn clause logic

  • Apr 01, 1996
  • IEEE Transactions on Knowledge and Data Engineering
  • J Jeffrey +2
  • Research Article
  • Citations79

Error diagnosis in logic programming an adaptation of E.Y. Shapiro's method

  • Sep 01, 1987
  • The Journal of Logic Programming
  • Gérard Ferrand
  • Book Chapter
  • Citations10

A framework for intelligent backtracking in logic programs

  • Jan 01, 1986
  • Vipin Kumar +1
  • Book Chapter
  • Citations10

A Type-Theoretic Approach to Resolution

  • Jan 01, 2015
  • Peng Fu +1
  • Book Chapter
  • Citations7

Extending Horn clause theories by reflection principles

  • Sep 05, 1994
  • Stefania Costantini +2
  • Research Article
  • Citations45

Complexity and undecidability results for logic programming

  • Sep 01, 1995
  • Annals of Mathematics and Artificial Intelligence
  • John S Schlipf
  • Book Chapter
  • Citations21

Avoiding Equivariance in Alpha-Prolog

  • Jan 01, 2005
  • Christian Urban +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.