IEICE TRANSACTIONS on transactions
A Framework for Deductive Logic Program Synthesis
Summary :
We propose a framework for deductive logic program synthesis from the first order specification in conjunction with the definition of total correctness for a synthesized program. The necessity of such definition comes from the fact that logic program synthesis is aimed at a nondeterministic program that computes a relation so that conventional definition of total correctness for the synthesized program, i.e. partial correctness
- Publication
- IEICE TRANSACTIONS on transactions Vol.E67-E No.10 pp.549-554
- Publication Date
- 1984/10/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Programming
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Taisuke SATO, Hisao TAMAKI, "A Framework for Deductive Logic Program Synthesis" in IEICE TRANSACTIONS on transactions,
vol. E67-E, no. 10, pp. 549-554, October 1984, doi: .
Abstract: We propose a framework for deductive logic program synthesis from the first order specification in conjunction with the definition of total correctness for a synthesized program. The necessity of such definition comes from the fact that logic program synthesis is aimed at a nondeterministic program that computes a relation so that conventional definition of total correctness for the synthesized program, i.e. partial correctness
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e67-e_10_549/_p
Copy
@ARTICLE{e67-e_10_549,
author={Taisuke SATO, Hisao TAMAKI, },
journal={IEICE TRANSACTIONS on transactions},
title={A Framework for Deductive Logic Program Synthesis},
year={1984},
volume={E67-E},
number={10},
pages={549-554},
abstract={We propose a framework for deductive logic program synthesis from the first order specification in conjunction with the definition of total correctness for a synthesized program. The necessity of such definition comes from the fact that logic program synthesis is aimed at a nondeterministic program that computes a relation so that conventional definition of total correctness for the synthesized program, i.e. partial correctness
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - A Framework for Deductive Logic Program Synthesis
T2 - IEICE TRANSACTIONS on transactions
SP - 549
EP - 554
AU - Taisuke SATO
AU - Hisao TAMAKI
PY - 1984
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E67-E
IS - 10
JA - IEICE TRANSACTIONS on transactions
Y1 - October 1984
AB - We propose a framework for deductive logic program synthesis from the first order specification in conjunction with the definition of total correctness for a synthesized program. The necessity of such definition comes from the fact that logic program synthesis is aimed at a nondeterministic program that computes a relation so that conventional definition of total correctness for the synthesized program, i.e. partial correctness
ER -
English
