On transformation of logic specifications into procedural programs

Janet M. Lin, J. Y. Juang, Sik-Sang Yau

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A method for transforming a source program expressed as a set of Horn clauses into a target program in an Algol-like procedural language is presented. Compared with deterministic execution of a conventional program, the top-down procedural interpretation of a Horn clause program is inherently nondeterministic. This transformation method is aimed at removing certain types of nondeterminism in a Horn clause program via a variable-dependence analysis and a procedure formation scheme. It is assumed that the input/output mode information for each predicate in the Horn clause is known in advance and that each predicate is used unidirectionally, i.e., each argument in the argument list of a predicate is used either as an input or an output, but not both. Therefore, the Horn clauses treated by this method represent only a subclass of the general Horn logic clauses. During the transformation process, the method is also capable of discovering inconsistent or missing information in the source program.

Original languageEnglish (US)
Title of host publicationIEEE Int Workshop Tools Artif Intell Archit Lang Algorithms
Editors Anon
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages274-281
Number of pages8
ISBN (Print)0818619848
StatePublished - 1989
Externally publishedYes
EventIEEE International Workshop on Tools for Artificial Intelligence: Architectures, Languages and Algorithms - Fairfax, VA, USA
Duration: Oct 23 1989Oct 25 1989

Other

OtherIEEE International Workshop on Tools for Artificial Intelligence: Architectures, Languages and Algorithms
CityFairfax, VA, USA
Period10/23/8910/25/89

Fingerprint

Specifications

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Lin, J. M., Juang, J. Y., & Yau, S-S. (1989). On transformation of logic specifications into procedural programs. In Anon (Ed.), IEEE Int Workshop Tools Artif Intell Archit Lang Algorithms (pp. 274-281). Piscataway, NJ, United States: Publ by IEEE.

On transformation of logic specifications into procedural programs. / Lin, Janet M.; Juang, J. Y.; Yau, Sik-Sang.

IEEE Int Workshop Tools Artif Intell Archit Lang Algorithms. ed. / Anon. Piscataway, NJ, United States : Publ by IEEE, 1989. p. 274-281.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lin, JM, Juang, JY & Yau, S-S 1989, On transformation of logic specifications into procedural programs. in Anon (ed.), IEEE Int Workshop Tools Artif Intell Archit Lang Algorithms. Publ by IEEE, Piscataway, NJ, United States, pp. 274-281, IEEE International Workshop on Tools for Artificial Intelligence: Architectures, Languages and Algorithms, Fairfax, VA, USA, 10/23/89.
Lin JM, Juang JY, Yau S-S. On transformation of logic specifications into procedural programs. In Anon, editor, IEEE Int Workshop Tools Artif Intell Archit Lang Algorithms. Piscataway, NJ, United States: Publ by IEEE. 1989. p. 274-281
Lin, Janet M. ; Juang, J. Y. ; Yau, Sik-Sang. / On transformation of logic specifications into procedural programs. IEEE Int Workshop Tools Artif Intell Archit Lang Algorithms. editor / Anon. Piscataway, NJ, United States : Publ by IEEE, 1989. pp. 274-281
@inproceedings{e1555ab92fc54b6dafc6c47df10616d0,
title = "On transformation of logic specifications into procedural programs",
abstract = "A method for transforming a source program expressed as a set of Horn clauses into a target program in an Algol-like procedural language is presented. Compared with deterministic execution of a conventional program, the top-down procedural interpretation of a Horn clause program is inherently nondeterministic. This transformation method is aimed at removing certain types of nondeterminism in a Horn clause program via a variable-dependence analysis and a procedure formation scheme. It is assumed that the input/output mode information for each predicate in the Horn clause is known in advance and that each predicate is used unidirectionally, i.e., each argument in the argument list of a predicate is used either as an input or an output, but not both. Therefore, the Horn clauses treated by this method represent only a subclass of the general Horn logic clauses. During the transformation process, the method is also capable of discovering inconsistent or missing information in the source program.",
author = "Lin, {Janet M.} and Juang, {J. Y.} and Sik-Sang Yau",
year = "1989",
language = "English (US)",
isbn = "0818619848",
pages = "274--281",
editor = "Anon",
booktitle = "IEEE Int Workshop Tools Artif Intell Archit Lang Algorithms",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - On transformation of logic specifications into procedural programs

AU - Lin, Janet M.

AU - Juang, J. Y.

AU - Yau, Sik-Sang

PY - 1989

Y1 - 1989

N2 - A method for transforming a source program expressed as a set of Horn clauses into a target program in an Algol-like procedural language is presented. Compared with deterministic execution of a conventional program, the top-down procedural interpretation of a Horn clause program is inherently nondeterministic. This transformation method is aimed at removing certain types of nondeterminism in a Horn clause program via a variable-dependence analysis and a procedure formation scheme. It is assumed that the input/output mode information for each predicate in the Horn clause is known in advance and that each predicate is used unidirectionally, i.e., each argument in the argument list of a predicate is used either as an input or an output, but not both. Therefore, the Horn clauses treated by this method represent only a subclass of the general Horn logic clauses. During the transformation process, the method is also capable of discovering inconsistent or missing information in the source program.

AB - A method for transforming a source program expressed as a set of Horn clauses into a target program in an Algol-like procedural language is presented. Compared with deterministic execution of a conventional program, the top-down procedural interpretation of a Horn clause program is inherently nondeterministic. This transformation method is aimed at removing certain types of nondeterminism in a Horn clause program via a variable-dependence analysis and a procedure formation scheme. It is assumed that the input/output mode information for each predicate in the Horn clause is known in advance and that each predicate is used unidirectionally, i.e., each argument in the argument list of a predicate is used either as an input or an output, but not both. Therefore, the Horn clauses treated by this method represent only a subclass of the general Horn logic clauses. During the transformation process, the method is also capable of discovering inconsistent or missing information in the source program.

UR - http://www.scopus.com/inward/record.url?scp=0024908751&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024908751&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0024908751

SN - 0818619848

SP - 274

EP - 281

BT - IEEE Int Workshop Tools Artif Intell Archit Lang Algorithms

A2 - Anon, null

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -