Treewidth and Indexicals: Applying Results in Tractability to Propagators
Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
I simplify a small part of tractability research in the field of time complexity in constraint programming. Treewidth and strong k-consistency can be combined in order to achieve tractability. The result is partially applied to Extended Indexicals by implementing treewidth in Extended Indexicals. Preliminary tests of the treewidth of the most common constraints have been carried out and the result is promising with the majority of the constraints having a low treewidth.
Place, publisher, year, edition, pages
2016. , 26 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:uu:diva-296882OAI: oai:DiVA.org:uu-296882DiVA: diva2:940052
Flener, PierreGällmo, Olle