From Approximate Clausal Reasoning to Problem Hardness

David Rajaratnam, Maurice Pagnucco. From Approximate Clausal Reasoning to Problem Hardness. In Dianhui Wang, Mark Reynolds, editors, AI 2011: Advances in Artificial Intelligence - 24th Australasian Joint Conference, Perth, Australia, December 5-8, 2011. Proceedings. Volume 7106 of Lecture Notes in Computer Science, pages 501-510, Springer, 2011. [doi]

@inproceedings{RajaratnamP11,
  title = {From Approximate Clausal Reasoning to Problem Hardness},
  author = {David Rajaratnam and Maurice Pagnucco},
  year = {2011},
  doi = {10.1007/978-3-642-25832-9_51},
  url = {http://dx.doi.org/10.1007/978-3-642-25832-9_51},
  researchr = {https://researchr.org/publication/RajaratnamP11},
  cites = {0},
  citedby = {0},
  pages = {501-510},
  booktitle = {AI 2011: Advances in Artificial Intelligence - 24th Australasian Joint Conference, Perth, Australia, December 5-8, 2011. Proceedings},
  editor = {Dianhui Wang and Mark Reynolds},
  volume = {7106},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-25831-2},
}