English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Correctness of unification without occur check in Prolog

Chadha, R., & Plaisted, D. A. (1994). Correctness of unification without occur check in Prolog. Journal of Logic Programming, 18(2), 99-122.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Chadha, Ritu, Author
Plaisted, David A.1, Author
Affiliations:
1Max Planck Society, ou_persistent13              

Content

show
hide
Free keywords: -
 Abstract: For efficiency reasons, most Prolog implementations do not include an occur check in their unification algorithms and thus do not conform to the semantic model of first-order logic. We present a simple test which guarantees that unification without occur check is sound in programs satisfying the conditions of the test. We designate each argument position of every predicate as either an input or an output position and then describe a sufficient condition in terms of this designation for unification without occur check to be sound. Unification with occur check can be performed in places in the program where this condition is not satisfied. Two algorithms for implementing this test are described and compared.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121994
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 519495
Other: Local-ID: C1256104005ECAFC-3738FC75AF6E3E90C125614400624651-chpl:94b
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Journal of Logic Programming
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 18 (2) Sequence Number: - Start / End Page: 99 - 122 Identifier: ISSN: 0743-1066