Predicate-calculus-based logics for modeling and solving search problems

ACM Transactions on Computational Logic

Volumn 7, Issue 1, 2006, Pages 38-83

  East, Deborah ^a,c   Truszczyński, Miroslaw ^b  

^a TEXAS STATE UNIVERSITY   (United States)

^b UNIVERSITY OF KENTUCKY   (United States)

^c Texas State University   (United States)

Author keywords

Constraints; Predicate logic; Pseudo Boolean constraints; Satisfiability; Search problems

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATION THEORY; COMPUTER SIMULATION; PROBLEM SOLVING; SEARCH ENGINES; SEMANTICS;

PREDICATE LOGIC; PSEUDO-BOOLEAN CONSTRAINTS; SATISFIABILITY; SEARCH PROBLEMS;

LOGIC PROGRAMMING;

EID: 33745233275     PISSN: 15293785     EISSN: 15293785     Source Type: Journal    
DOI: 10.1145/1119439.1119441     Document Type: Article

References (60)

1. ABITEBOUL, S. AND VIANU, V. 1991. Datalog extensions for database queries and updates. J. Comput. Syst. Sci. 43, 1, 62-124.
2. ALOUL, P., RAMANI, A., MARKOV, I., AND SAKALLAH, K. 2002. PBS: A backtrack-search pseudo-Boolean solver and optimizer. In Proceedings of the 5th International Symposium on Theory and Applications of Satisfiability. 346-353.
3. ALOUL, F., RAMANI, A., MARKOV, I., AND SAKALLAH, K. 2003. PBS v0.2, incremental pseudo-Boolean backtrack search SAT solver and optimizer. Go online to http://www.eecs.umich.edu/~faloul/Tools/pbs/.
4. APT, K. 1990. Logic programming. In Handbook of Theoretical Computer Science, J. van Leeuven, Ed. Elsevier, Amsterdam, The Netherlands, 493-574.
5. BABOVICH, Y. AND LIPSCHITZ, V. 2002. Cmodels Package. Go online to http : //www.cs.utexas.edu/users/tag/cmodals.html.
6. BARAL, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge, U.K.
7. EARTH, P. 1995. A Davis-Putnam based elimination algorithm for linear pseudo-Boolean optimization. Tech. rep. MPI-I-95-2-003. Max-Planck-Institut für Informatik, Saarbrückm, Germany.
8. BAYARDO, JR., R. AND SCHRAG, R. 1997. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-1997). AAAI Press, Menlo Park, CA, 203-208.
9. BENHAMOU, B., SAIS, L., AND SIEGEL, P. 1994. Two proof procedures for a cardinality based language in propositional calculus. In. Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science (STACS-1994). Lecture Notes in Computer Science, vol. 775. Springer, Berlin, Germany, 71-82.
10. CADOLI, M. AND MANCINI, T. 2002. Combining relational algebra, SQL, and constraint programming. In Proceeding of the 4th International Workshop on Frontiers of Combining Systems (FroCoS-2002). Lecture Notes in Artificial Intelligence, vol. 2309. Springer, Berlin, Germany, 147-161.
11. CADOLI, M. AND PALIPOLI, L. 1998. Circumscribing datalog: Expressive power and complexity. Theor. Comput. Sci. 193, 215-244.
12. CADOLI, M. AND SCHAERF, A. 2001. Compiling problem specifications into SAT. In Proceedings of the European Symposium On Programming (ESOP-2001). Lecture Notes in Artificial Intelligence, vol. 2028. Springer, Berlin, Germany, 387-401.
13. CLARK, K. 1978. Negation as failure. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum Press, NY/London, U.K., 293-322.
14. COLMERAUER, A., KANOUI, H., PASERO, R., AND ROUSSEL, P. 1973. Un systeme de communication homme-machine en francais. Tech. rep. University of Marseille, Marseille, France.
15. DELL'ARMI, T., FABER, W., IELPA, G., LEONE, N., AND PFEIFER, G. 2003. Aggregate functions in disjunctive logic programming: Semantics, complexity, and implementation in DLV. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003), Morgan Kaufmann, San Francisco, CA, 847-852.
16. DIMOPOULOS, Y. AND SIDERIS, A. 2002. Towards local search for answer sets. In Proceedings of the 18th International Conference on Logic Programming. Lecture Notes in Computer Science, vol. 2401. Springer, Berlin, Germany, 363-367.
17. DIXON, H. AND GINSBERG, M. 2002. Inference methods for a pseudo-Boolean satisfiability solver. In The 18th National Conference on Artificial Intelligence (AAAI-2002). AAAI Press, Menlo Park, CA, 635-640.
18. EAST, D. AND TRUSZCZYŃSKI, M. 2000. Datalog with constraints. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-2000). AAAI Press, Menlo Park, CA, 163-168.
19. EAST, D. AND TRUSZCZYŃSKI, M. 2001a. ASP solver aspps. Go online to http://www.cs.uky.edu/aspps/.
20. EAST, D. AND TRUSZCZYŃSKI, M. 2001. Propositional satisfiability in answer-set programming. In Proceedings of Joint German/Austrian Conference on Artificial Intelligence (KI-2001), Lecture Notes in Artificial Intelligence, vol. 2174. Springer, Berlin, Germany, 138-153.
21. EITER, T., LEONE, N., MATEIS, C., PFEIFER, G., AND SCARCELLO, F. 1998. A KR system dlv: Progress report, comparisons and benchmarks. In Proceeding of the 6th International Conference on Knowledge Representation and Reasoning (KR-1998). Morgan Kaufmann, San Francisco, CA, 406-417.
22. ERDEM, E. AND LIFSCHITZ, V. 2003. Tight logic programs. Theor. Pract. Logic Programm. 3, 4-5, 499-518.
23. FAGIN, R. 1974. Generalized first-order spectra and polynomial-time recognizable sets. In Complexity of Computation, R. Karp, Ed. AMS, Providence, RI. 43-74.
24. FOURER, R., GAY, D., AND KEHNIGHAM, B. 1993. AMPL: A Modeling Language for Mathematical Programming. Thomson Publishing Company, Florence, KY.
25. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable semantics for logic programs. In Proceedings of the 5th International Conference on Logic Programming. MIT Press, Cambridge, MA, 1070-1080.
26. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Gen. Comput. 9, 365-385.
27. GINSBERG, M. AND PARKES, A. 2000. Satisfiability algorithms and finite quantification. In Proceedings of the 7th International Conference on Principles of Knowledge Representation and Reasoning, (KR-2000). Morgan Kaufmann, San Francisco, CA, 690-701.
28. GOTTLOB, G., KOLAITIS, P., AND SCHWENTICK, T. 2000. Existential second-order logic over graphs: Charting the tractability frontier. In Proceedings of the 41st Symposium on Foundations of Computer Science (FOGS-2000). IEEE Computer Science Press, Los Alamitos, CA, 664-674.
29. GREEN, C. 1969. Application of theorem proving to problem solving. In Proceedings of the 1st International Joint Conference on Artificial Intelligence (IJCAI-1969). Morgan Kaufmann, San Francisco, CA, 741-747.
30. KAUTZ, H., MCALLESTER, D., AND SELMAN, B. 1996. Encoding plans in prepositional logic. In Proceedings of 6th International Conference on Principles of Knowledge Representation and Reasoning (KR-1996). Morgan Kaufmann, San Francisco, CA, 374-384.
31. KOWALSKI, R. 1974. Predicate logic as a programming language. In Proceedings of the Congress of the International Federation for Information Processing (IFIP-1974). North Holland, Amsterdam, The Netherlands, 569-574.
32. LEONE, N., PFEIFER, G., FABER, W., EITER, T., GOTTLOB, G., PERRI, S., AND SCARCELLO, F. 2003. The dlv system for knowledge representation and reasoning. Go online to http://xxx.lanl.gov/abs/cs.AI/0211004.
33. Li, C. 1997. SAT solver sate. Go online to http://www.laria.u-picardie.fr/~cli/EnglishPage.html.
34. Li, C. AND ANBULAGAN, M. 1997. Look-ahead versus look-back for satisfiability problems. In Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, vol. 1330. Springer, Berlin, Germany, 342-356.
35. LIN, F. AND ZHAO, Y. 2002. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-2002). AAAI Press, Menlo Park, CA, 112-117.
36. Liu, L. AND TRUSZCZYŃSKI, M. 2003. Local-search techniques in prepositional logic extended with cardinality atoms. In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming, CP-2003. Lecture Notes in Computer Science, vol. 2833. Springer, Berlin, Germany, 495-509.
37. MAREK, V. AND REMMEL, J. 2003. On the expressibility of stable logic programming. Theor. Pract. Logic Program. 3, 551-567.
38. MAREK, V. AND TRUSZCZYŃSKI, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective, K. Apt, W. Marek, M. Truszczyński, and D. Warren, Eds. Springer, Berlin, Germany, 375-398.
39. MAREK, W. AND THUSZCZYŃSKI, M. 1993. Nonmonotonic Logic; Context-Dependent Reasoning. Springer, Berlin, Germany.
40. MCCARTHY, J. 1980. Circumscription - A form of non-monotonic reasoning. Artific, Intell. 13, 1-2, 27-39.
41. MOSKEWICZ, M., MADIGAN, C., ZHAO, Y., ZHANG, L., AND MALIK, S. 2001a. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th ACM IEEE Design Automation Conference. ACM Press, New York, NY, 530-535.
42. MOSKEWICZ, M., MADIGAN, C., ZHAO, Y., ZHANG, L., AND MALIK, S. 2001b. SAT solver chaff. Go online to http://www.ee.princeton.edu/~chaff/.
43. NERODE, A. AND SHORE, R. 1993. Logic and Logic Programming. Springer, Berlin, Germany.
44. NIEMELÄ, I. 1999. Logic programming with stable model semantics as a constraint programming paradigm. Ann. Math. Artific. Intell. 25, 3-4, 241-273.
45. NIEMELÄ, I. AND SIMONS, P. 2000. Extending the smodels system with cardinality and weight constraints. In Logic-Based Artificial Intelligence, J. Minker, Ed. Kluwer Academic Publishers, Dordrecht, The Netherlands, 491-521.
46. NIEMELä, I., SIMONS, P., AND SYRJäNEN, T. 1997. SLP solver smodels. Go online to http://www.tcs.hut.fi/Software/smodels/.
47. PARKES, A. 1999. Lifted search engines for satisfiability. Ph.D. dissertation. Department of Computer Science, University of Oregon, Eugene, OR.
48. PRESTWICH, S. 2002. Randomised backtracking for linear pseudo-Boolean constraint problems. In Proceedings of the 4th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems, (CPAIOR-2002). 7-20. Go online to http://www.emn.fr/x-info/cpaior/Proceedings/CPAIOR.pdf.
49. ROBINSON, J. 1965. A machine-oriented logic based on resolution principle. J. Assoc. Comput. Soc. 12, 23-41.
50. SACCÀ, D. 1997. The expressive powers of stable models for bound and unbound datalog queries. J. Comput. Syst. Sci. 54, 3, 441-464.
51. SCHLIPF, J. 1995. The expressive powers of the logic programming semantics. J. Comput. Syst. Sci. 51, 1, 64-86.
52. SELMAN, A. 1994. A taxonomy of complexity classes of functions. J. Comput. Syst. Sci. 48, 2, 357-381.
53. SELMAN, B., KAUTZ, H., AND COHEN, B. 1994. Noise strategies for improving local search. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-1994). AAAI Press, Menlo Park, CA, 337-343.
54. SIMONS, P., NIEMELÄ, I., AND SOININEN, T. 2002. Extending and implementing the stable model semantics. Artific. Intell. 138, 181-234.
55. ULLMAN, J. 1988. Principles of Database and Knowledge-Base Systems. Computer Science Press, Rockville, MD.
56. VAN HENTENRYCK, P. 1999. The OPL Optimization Programming Language. MIT Press, Cambridge, MA.
57. VARDI, M. 1982. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on Theory of Computing (STOC-1982). ACM Press, New York, NY, 137-146.
58. e: A platform for constraint logic programming. Go online to http://www.icparc.ic.ac.uk/eclipse/reports/eclipse.ps.gz.
59. WALSER, J. 1997. Solving linear pseudo-Boolean constraints with local search. In Proceedings of the 11th National Conference on Artificial Intelligence (AAAI-97). AAAI Press, Menlo Park, CA, 269-274.
60. WALSH, T. 2003. Challenges in SAT (and QBF). Invited talk at 6th International Conference on Theory and Applications of Satisfiability Testing. Slides available online from http://4c.ucc.ie/~tw/sat2003.ppt.