Bounds on the Propagation of Selection into Logic Programs

Abstract

We consider the problem of propagating selections (i.e., bindings of variables) into logic programs. In particular, we study the class of binary chain programs and define selection propagation as the task of finding an equivalent program containing only unary derived predicates. We associate a context free grammar <italic>L(H)</italic> with every binary… (More)
DOI: 10.1145/28659.28683

Topics

Statistics

0510'90'93'96'99'02'05'08'11'14'17
Citations per Year

53 Citations

Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics