Tight, Consistent and Computable Completions for Unrestricted Logic Programs - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Mark Wallace. Tight, Consistent and Computable Completions for Unrestricted Logic Programs. Journal of Logic and Algebraic Programming, 15(3):243-273, 1993.

@article{Wallace93,
  title = {Tight, Consistent and Computable Completions for Unrestricted Logic Programs},
  author = {Mark Wallace},
  year = {1993},
  tags = {logic programming, logic},
  researchr = {https://researchr.org/publication/Wallace93},
  cites = {0},
  citedby = {0},
  journal = {Journal of Logic and Algebraic Programming},
  volume = {15},
  number = {3},
  pages = {243-273},
}

runs on WebDSL