NP Datalog: A logic language for expressing NP search and optimization problems

Theory and Practice of Logic Programming

Volumn 10, Issue 2, 2010, Pages 125-166

  Greco, Sergio ^a   Molinaro, Cristian ^a   Trubitsyna, Irina ^a   Zumpano, Ester ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Constraint programming; Expressivity and complexity of declarative query languages; Logic languages; Stable model semantics

Indexed keywords

CONSTRAINT PROGRAMMING; DATALOG; DECLARATIVE LOGIC; DECLARATIVE QUERY LANGUAGES; LOGIC LANGUAGES; OPTIMIZATION PROBLEMS; OPTIMIZATION PROGRAMMING; STABLE MODEL SEMANTICS; STRATIFIED NEGATION; SYSTEM PROTOTYPE;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; LINGUISTICS; OPTIMIZATION; PROBLEM ORIENTED LANGUAGES; SEMANTICS;

QUERY LANGUAGES;

EID: 77951256621     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068409990251     Document Type: Article

References (49)

1. Abiteboul, S., Hull, R. and Vianu, V. 1995. Foundations of Databases. Addison-Wesley.
2. Balduccini, M., Gelfond, M. and Nogueira, M. 2000. A-Prolog as a tool for declarative programming. In Proc. of the International Conference on Software Engineering and Knowledge Engineering 63-72.
3. Baral, C. 2003. Knowledge Representation Reasoning and Declarative Problem Solving. Cambridge University Press.
4. Cadoli, M., Ianni, G., Palopoli, L., Schaerf, A. and Vasile, D. 2000. NP-SPEC: An executable specification language for solving all problems in NP. Computer Languages 26 (2-4), 165-195.
5. Cadoli, M. and Schaerf, A. 2005. Compiling problem specifications into SAT. Artificial Intelligence 162 (1-2), 89-120.
6. Cholewinski, P., Marek, V. W. and Truszczynski, M. 1996. Default reasoning system DeReS. In Proc. of the International Conference on Principles of Knowledge Representation and Reasoning, L. C. Aiello et al., Eds. Morgan Kaufmann, 518-528.
7. Denecker, M. 2000. Extending classical logic with inductive definitions. In Proc. of the International Conference on Computational Logic, J. W. Lloyd et al., Eds. LNCS, vol.1861. Springer, 703-717.
8. East, D. and Truszczynski, M. 2000. DATALOG with constraints - An answer-set programming system. In Proc. of the National Conference on Artificial Intelligence, AAAI Press/The MIT Press, 163-168.
9. East, D. and Truszczynski, M. 2006. Predicate-calculus based logics for modeling and solving search problems. ACM Transaction on Computational Logic 7 (1), 38-83.
10. Eiter, T., Leone, N.,Mateis, C., Pfeifer, G. and Scarcello, F. 1997. A deductive system for non-monotonic reasoning. In Proc. of the International Conference on Logic Programming and Nonmonotonic Reasoning, J. Dix et al., Eds. LNCS, vol.1265. Springer, 363-374.
11. Fagin, R. 1974. Generalized first-order spectra and polynomial-time recognizable sets. In Complexity of Computation, R. Karp, Ed. SIAM-AMS Proc., vol.7, 43-73.
12. Finkel, R. A., Marek, V. W. and Truszczynski, M. 2004. Constraint Lingo: Towards high-level constraint programming. Software Practice and Experience 34 (15), 1481-1504.
13. Gebser, M., Kaufmann, B., Neumann, A. and Schaub, T. 2007. Conflict-driven answer set solving. In Proc. of the International Joint Conference on Artificial Intelligence, M. M. Veloso, Ed., 386-392.
14. Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proc. of the International Conference on Logic Programming, R. A. Kowalski and K. A. Bowen, Eds. The MIT Press, 1070-1080.
15. Gelfond, M. 2002. Representing knowledge in a-prolog. Computational Logic: Logic Programming and Beyond, A. C. Kakas and F. Sadri, Eds. LNCS, vol.2408. Springer, 413-451.
16. Greco, S. 1999. Dynamic programming in datalog with aggregates. IEEE Transactions on Knowledge and Data Engineering 11 (2), 265-283.
17. Greco, S. and Saccà , D. 2002. Search and optimization problems in datalog. Computational Logic: Logic Programming and Beyond, A. C. Kakas and F. Sadri, Eds. LNCS, vol.2408. Springer, 61-82.
18. Greco, S. and Saccà , D. 1997. NP optimization problems in datalog. In Symposium on Logic Programming, J. Maluszynski, Ed. The MIT Press, 181-195.
19. Greco, S., Saccà , D. and Zaniolo C. 1995. Datalog with stratified negation and choice: from P to DP. In Proc. of the International Conference on Database Theory, G. Gottlob and M. Y. Vardi, Eds. LNCS, vol.893. Springer, 574-589.
20. Greco, S. and Zaniolo, C. 2001. Greedy algorithms in datalog. Theory and Practice of Logic Programming 1 (4), 381-407.
21. Jaffar, J., Michaylov, S., Stuckey, P.J. and Yap, R. 1992. The CLP(R) language and system. ACM Transaction on Programming Languages and Systems 14 (3), 339-395.
22. Johnson, D. S. 1990. A Catalog of Complexity Classes. In Handbook of Theoretical Computer Science, Vol.1, J. van Leewen, Ed. North-Holland, 67-161.
23. Kluzniak, F. and Milkowska, M. 1997. Spill - A logic language for writing testable requirements specifications. Science of Computer Programming 28 (2-3), 193-223.
24. Kolaitis, P. and Papadimitriou, C. 1991. Why not negation by fixpoint? Journal of Computer and System Sciences 43 (1), 125-144.
25. Kolaitis, P. G. and Thakur, M. N. 1995. Approximation properties of NP minimization classes. Journal of Computer and System Sciences 50 (3), 391-411.
26. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S. and Scarcello, F. 2006. The DLV System for knowledge representation and reasoning. ACM Transactions on Computational Logics 7 (3), 499-562.
27. Lierler, Y. 2005. Disjunctive answer set programming via satisfiability. In Proc. of the International Workshop on Answer Set Programming, M. De Vos and A. Provetti, Eds. CEUR Workshop Proceedings 142, 85-97.
28. Lierler, Y. 2005. Cmodels - SAT-based disjunctive answer set solver. In Proc. of the International Conference on Logic Programming and Nonmonotonic Reasoning, C. Baral et al., Eds. LNCS, vol.3662. Springer, 447-451.
29. Lin, F. and Zhao, Y. 2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157 (1-2), 115-137.
30. Marek, W. and Truszczynski, M. 1991. Autoepistemic logic. Journal of the ACM 38 (3), 588-619.
31. Marien, M., Gilis, D. and Denecker, M. 2004. On the relation between ID-logic and answer set programming. Logics in Artificial Intelligence, J. J. Alferes and J. A. Leite, Eds. LNCS, vol.3229. Springer, 108-120.
32. Marriott, K. and Stuckey, P. J. 1998. Programming with Constraints: An Introduction. MIT Press.
33. Niemela, I., Simons, P. and Soininen, T. 1999. Stable model semantics of weight constraint rules. In Proc. of the International Conference on Logic Programming and Nonmonotonic Reasoning, M. Gelfond et al., Eds. LNCS, vol.1730. Springer, 317-331.
34. Papadimitriou, C. H. and Steiglitz, K. 1982. Combinatorial Optimization - Algorithms and Complexity. Prentice-Hall.
35. Papadimitriou, C. H. and Yannakakis, M. 1991. Optimization, approximation, and complexity classes. Journal Computer and System Sciences 43 (3), 425-440.
36. Papadimitriou, C. H. 1994. Computational Complexity. Addison-Wesley.
37. Rao, P., Sagonas, K. F., Swift, T., Warren, D. S. and Freire, J. 1997. XSB: A system for effciently computing WFS. In Proc. of the International Conference on Logic Programming and Nonmonotonic Reasoning, J. Dix et al., Eds. LNCS, vol.1265. Springer, 431-441.
38. Saccà , D. 1997. The expressive powers of stable models for bound and unbound queries. Journal of Computer and System Sciences 54 (3), 441-464.
39. Schlipf, J. S. 1995. The expressive powers of the logic programming semantics. Journal of Computer and System Sciences 51 (1), 64-86.
40. Smith, D. R. 1990. KIDS: A semiautomatic program development system. IEEE Transaction on Software Engineering 16 (9), 1024-1043.
41. Simons, P., Niemela, I. and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138 (1-2), 181-234.
42. Ullman, J. K. 1988. Principles of Data and Knowledge-Base Systems, Vol.1. Computer Science Press, New York.
43. Van Gelder, A., Ross, K. A. and Schlipf, J. S. 1991. The well-founded semantics for general logic programs. Journal of ACM 38 (3), 620-650.
44. Van Hentenryck, P. 1988. The OPL Optimization Programming Language. MIT Press.
45. Van Hentenryck, P., Michel, L., Perron, L. and Regin, J. C. 1999. Constraint programming in OPL. In Proc. of the International Conference on Principles and Practice of Declarative Programming, G. Nadathur, Ed. LNCS, vol.1702. Springer, 98-116.
46. Van Roy, P. 1999. Logic programming in Oz with Mozart. In Proc. of the International Conference on Logic Programming, D. De Schreye, Ed. The MIT Press, 38-51.
47. Wallace, M. and Schimpf, J. 1999. ECLiPSe: declarative specification and scaleable implementation. In Proc. of the International Workshop on Practical Aspects of Declarative Languages, G. Gupta, Ed. LNCS, vol.1551. Springer, 365-366.
48. Zhou, N. 2002. Implementing constraint solvers in B-prolog. Intelligent Information Processing, M. A. Musen et al., Eds. IFIP Conference Proceedings, 249-260.
49. Zumpano, E., Greco, S., Trubitsyna, I. and Veltri, P. 2004. On the semantics and expressive power of Datalog-like languages for NP search and optimization problems. In Proc. of the ACM Symppsium on Applied Computing, H. Haddad et al., Eds. ACM, 692-697.