104 research outputs found
Choice Disjunctive Queries in Logic Programming
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 \add G_1 where are goals. These goals have the following
intended semantics: the true disjunct and execute where , while the unchosen disjunct. Note that only
one goal can remain alive during execution. These goals thus allow us to
specify mutually exclusive tasks in a high-level way.Comment: 8 pages. Implementation scheme from the previous version contains an
error. A new, correct implementation scheme is describe
- …