Abstract
In this paper, a logic-based specification language, called npspec, 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. © Springer-Verlag Berlin Heidelberg 1998.
Cite
CITATION STYLE
Cadoli, M., Palopoli, L., Schaerf, A., & Vasile, D. (1999). NP-SPEC: An executable specification language for solving all problems in NP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1551 LNCS, pp. 16–30). https://doi.org/10.1007/3-540-49201-1_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
