Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
KIDS: A Semiautomatic Program Development System
IEEE Transactions on Software Engineering
Generating hard satisfiability problems
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Spill—a logic language for writing testable requirements specifications
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
Circumscribing DATALOG: expressive power and complexity
Theoretical Computer Science
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Compiling High-Level Type Constructors in Constraint Programming
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Stable Model Semantics of Weight Constraint Rules
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Recent Advances in Constraints
PBINT, a logic for modelling search problems involving arithmetic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Transforming and refining abstract constraint specifications
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
NP-SPEC: an executable specification language for solving all problems in NP
Computer Languages
| Hi-index | 0.00 |
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.