Inproceedings,
A Knowledge Base on NP-complete Decision Problems and its Application in Bibliographic Search
Proc. of Berliner XML-Tage 2006, Berlin, Germany, (2006)
Abstract
One of the most important questions in computer science is the “P=NP”-question. For this reason, much attention has been given to the analysis of NPcomplete decision problems. We have developed a knowledge base of NP-complete decision problems that reflects the conceptual knowledge and the relationships of more than 350 decision problems including additional information resources such as bibliographic references or author information. The knowledge base is applied by the web based bibliographic search tool NPBibSearch. By providing an intuitive graphical user interface for navigation within the domain of NP-complete decision problems and by integrating full text search capabilities with conceptual knowledge, NPBibSearch offers the user an ontology augmented bibliographic search.
