The search functionality is under construction.

The search functionality is under construction.

One of the long-standing research problems on logic programming is to treat the cut predicate in a logical, high-level way. We argue that this problem can be solved by adopting linear logic and choice-disjunctive goal formulas of the form *G*_{0} ⊕ *G*_{1} where *G*_{0}, *G*_{1} are goals. These goals have the following intended semantics: *choose* the true disjunct *G _{i}* and execute

- Publication
- IEICE TRANSACTIONS on Information Vol.E106-D No.3 pp.333-336

- Publication Date
- 2023/03/01

- Publicized
- 2022/12/19

- Online ISSN
- 1745-1361

- DOI
- 10.1587/transinf.2022FCL0001

- Type of Manuscript
- Special Section LETTER (Special Section on Foundations of Computer Science — Foundations of Computer Science Supporting the Information Society —)

- Category

Keehang KWON

DongA University

Daeseong KANG

DongA University

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.

Copy

Keehang KWON, Daeseong KANG, "Choice Disjunctive Queries in Logic Programming" in IEICE TRANSACTIONS on Information,
vol. E106-D, no. 3, pp. 333-336, March 2023, doi: 10.1587/transinf.2022FCL0001.

Abstract: One of the long-standing research problems on logic programming is to treat the cut predicate in a logical, high-level way. We argue that this problem can be solved by adopting linear logic and choice-disjunctive goal formulas of the form *G*_{0} ⊕ *G*_{1} where *G*_{0}, *G*_{1} are goals. These goals have the following intended semantics: *choose* the true disjunct *G _{i}* and execute

URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2022FCL0001/_p

Copy

@ARTICLE{e106-d_3_333,

author={Keehang KWON, Daeseong KANG, },

journal={IEICE TRANSACTIONS on Information},

title={Choice Disjunctive Queries in Logic Programming},

year={2023},

volume={E106-D},

number={3},

pages={333-336},

abstract={One of the long-standing research problems on logic programming is to treat the cut predicate in a logical, high-level way. We argue that this problem can be solved by adopting linear logic and choice-disjunctive goal formulas of the form *G*_{0} ⊕ *G*_{1} where *G*_{0}, *G*_{1} are goals. These goals have the following intended semantics: *choose* the true disjunct *G _{i}* and execute

keywords={},

doi={10.1587/transinf.2022FCL0001},

ISSN={1745-1361},

month={March},}

Copy

TY - JOUR

TI - Choice Disjunctive Queries in Logic Programming

T2 - IEICE TRANSACTIONS on Information

SP - 333

EP - 336

AU - Keehang KWON

AU - Daeseong KANG

PY - 2023

DO - 10.1587/transinf.2022FCL0001

JO - IEICE TRANSACTIONS on Information

SN - 1745-1361

VL - E106-D

IS - 3

JA - IEICE TRANSACTIONS on Information

Y1 - March 2023

AB - One of the long-standing research problems on logic programming is to treat the cut predicate in a logical, high-level way. We argue that this problem can be solved by adopting linear logic and choice-disjunctive goal formulas of the form *G*_{0} ⊕ *G*_{1} where *G*_{0}, *G*_{1} are goals. These goals have the following intended semantics: *choose* the true disjunct *G _{i}* and execute

ER -