np-spec: An Executable Specification Language for Solving All Problems in NP
- 314 Downloads
In this paper, a logic-based specification language, called np-spec, is presented. The language is obtained extending datalog through allowing a limited use of some second-order predicates of predefined form. np-spec programs specify solutions to problems in a very abstract and concise way, and are executable. In the present prototype they are compiled to prolog code which is run to construct outputs. Second-order predicates of suitable form allow to limit the size of search spaces in order to obtain reasonably efficient construction of problem solutions. np-spec expressive power is precisely characterized as to express exactly the problems in the class NP.
KeywordsSearch Space Knapsack Problem Prolog Program Datalog Program Input Database
Unable to display preview. Download preview PDF.
- [Agg98]A. Aggoun et al. ECL i PS e User Manual (Version 4.0). IC-Parc, Germany, July 1998.Google Scholar
- [Böh92]M. Böhm. Sat solver, 1992. Computer program available at http://www.informatik.uni-koeln.de/ls_juenger/staff/boehm/src.html.
- [ELM+98]T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. The KR system dlv: Progress report, comparisons and benchmarks. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), pages 406–417, 1998.Google Scholar
- [ILO98]ILOG optimization suite — white paper. Available athttp://www.ilog.com, 1998.
- [Lif85]V. Lifschitz. Computing circumscription. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI-85), pages 121–127, 1985.Google Scholar
- [Smi90]D. R. Smith. KIDS: A semi-automatic program development system. IEEE Transactions on Software Engineering, 16(9), 1990.Google Scholar
- [Ull88]J. D. Ullman. Principles of Database and Knowledge Base Systems, volume 1. Computer Science Press, 1988.Google Scholar