Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aggoun et al. ECL i PS e User Manual (Version 4.0). IC-Parc, Germany, July 1998.
M. Böhm. Sat solver, 1992. Computer program available at http://www.informatik.uni-koeln.de/ls_juenger/staff/boehm/src.html.
M. Buro and H. Kleine Büning. Report on a SAT competition. EATCS Bulletin, 49:143–151, 1993.
M. Cadoli and L. Palopoli. Circumscribing datalog: expressive power and complexity. Theoretical Computer Science, 193:215–244, 1998.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201–215, 1960.
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.
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco,Ca, 1979.
ILOG optimization suite — white paper. Available athttp://www.ilog.com, 1998.
F. Kluzniak and M. Milkowska. Spill-a logic language for writing testable requirements specifications. Science of Computer Programming, 28:193–223, 1997.
V. Lifschitz. Computing circumscription. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI-85), pages 121–127, 1985.
J. McCarthy. Circumscription-A form of non-monotonic reasoning. Artificial Intelligence, 13:27–39, 1980.
S. Minton. Automatic configuring constraint satisfaction programs: A case study. Constraints, 1(1/2):7–43, 1996.
D. R. Smith. KIDS: A semi-automatic program development system. IEEE Transactions on Software Engineering, 16(9), 1990.
B. Selman, D. Mitchell, and H. Levesque. Generating Hard Satisfiability Problems. Artificial Intelligence, 81:17–29, 1996.
J. D. Ullman. Principles of Database and Knowledge Base Systems, volume 1. Computer Science Press, 1988.
M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733–742, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cadoli, M., Palopoli, L., Schaerf, A., Vasile, D. (1998). np-spec: An Executable Specification Language for Solving All Problems in NP. In: Gupta, G. (eds) Practical Aspects of Declarative Languages. PADL 1999. Lecture Notes in Computer Science, vol 1551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49201-1_2
Download citation
DOI: https://doi.org/10.1007/3-540-49201-1_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65527-5
Online ISBN: 978-3-540-49201-6
eBook Packages: Springer Book Archive