| Abstract: | In this paper a logic-based specification language, called -, is presented. The language is obtained by extending through allowing a limited use of some second-order predicates of predefined form. - programs specify solutions to problems in a very abstract and concise way, and are executable. In the present prototype they are compiled to 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. - expressive power is precisely characterized as to express exactly the problems in the class NP. The specification of several combinatorial problems in - is shown, and the efficiency of the generated programs is evaluated. |
