On the Complexity of Perfect Models of Logic Programs - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Sergey Dudakov. On the Complexity of Perfect Models of Logic Programs. Fundamenta Informaticae, 39(3):249-258, 1999.

@article{Dudakov99,
  title = {On the Complexity of Perfect Models of Logic Programs},
  author = {Sergey Dudakov},
  year = {1999},
  tags = {logic programming, logic},
  researchr = {https://researchr.org/publication/Dudakov99},
  cites = {0},
  citedby = {0},
  journal = {Fundamenta Informaticae},
  volume = {39},
  number = {3},
  pages = {249-258},
}

runs on WebDSL