Mutually Exclusive Queries in Logic Programming
Keehang Kwon · arXiv (Cornell University) · 2012
Logic programming has traditionally lacked devices for expressing mutually exclusive goals and queries. We address this limitation by adopting choice-disjunctive goal formulas of the form $G_1 + G_2$ where $G_1, G_2$ are goals and + is a linear logic connective. These goals has the following operational semantics: choose and solve a true disjunct $G_i$ where i (= 1 or 2) is chosen by the machine. It is worth noting that our operational semantics obtains mutual exclusion by choosing one between two disjuncts. Thus, our operational semantics of + corresponds well to its declarative semantics known as the machine's choice.