Lower-bound Time-complexity Analysis of Logic Programs - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Andy King, Kish Shen, Florence Benoy. Lower-bound Time-complexity Analysis of Logic Programs. In ILPS. pages 261-275, 1997.

@inproceedings{KingSB97,
  title = {Lower-bound Time-complexity Analysis of Logic Programs},
  author = {Andy King and Kish Shen and Florence Benoy},
  year = {1997},
  tags = {program analysis, analysis, logic programming, logic},
  researchr = {https://researchr.org/publication/KingSB97},
  cites = {0},
  citedby = {0},
  pages = {261-275},
  booktitle = {ILPS},
}

runs on WebDSL