Executing Suspended Logic Programs

  • Authors:
  • Robert A. Kowalski;Francesca Toni;Gerhard Wetzel

  • Affiliations:
  • Department of Computing, Imperial College of Science, Technology and Medicine, London SW7 2BZ, UK. {rak,ft}@doc.ic.ac.uk;(Correspd.) Department of Computing, Imperial College of Science, Technology and Medicine, London SW7 2BZ, UK. {rak,ft}@doc.ic.ac.uk;(Correspd.) Logic Based Systems Lab, Department of Computer Science, Brooklyn College, NY 11210, USA. gw@sci.brooklyn.cuny.edu

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an extension of Logic Programming (LP) which, in addition to ordinary LP clauses, also includes integrity constraints, explicit representation of disjunction in the bodies of clauses and in goals, and suspension of atoms as in concurrent logic languages. The resulting framework aims to unify Constraint Logic Programming (CLP), Abductive Logic Programming (ALP) and Semantic Query Optimisation (SQO) in deductive databases. We present a proof procedure for the new framework, simplifying and generalising previously proposed proof procedures for ALP. We discuss applications of the framework, formulating traditional problems from LP, ALP, CLP and SQO.