English

Mutually Exclusive Modules in Logic Programming

Programming Languages 2015-06-17 v1

Abstract

Logic programming has traditionally lacked devices for expressing mutually exclusive modules. We address this limitation by adopting choice-conjunctive modules of the form D0&D1D_0 \& D_1 where D0,D1D_0, D_1 are a conjunction of Horn clauses and &\& is a linear logic connective. Solving a goal GG using D0&D1D_0 \& D_1 -- exec(D0&D1,G)exec(D_0 \& D_1,G) -- has the following operational semantics: choosechoose a successful one between exec(D0,G)exec(D_0,G) and exec(D1,G)exec(D_1,G). In other words, if D0D_0 is chosen in the course of solving GG, then D1D_1 will be discarded and vice versa. Hence, the class of choice-conjunctive modules can capture the notion of mutually exclusive modules.

Keywords

Cite

@article{arxiv.1506.04857,
  title  = {Mutually Exclusive Modules in Logic Programming},
  author = {Keehang Kwon},
  journal= {arXiv preprint arXiv:1506.04857},
  year   = {2015}
}

Comments

5 pages

R2 v1 2026-06-22T09:54:18.365Z