Tools for modeling and solving search problems

AI Communications

Volumn 19, Issue 4, 2006, Pages 301-312

  East, Deborah ^a   Iakhiaev, Mikhail ^b   Mikitiuk, Artur ^c   Truszczyński, Mirosław ^d  

^a Texas State University   (United States)

^b University of Texas at Austin   (United States)

^c UNIVERSITY OF TEXAS AT TYLER   (United States)

^d UNIVERSITY OF KENTUCKY   (United States)

Author keywords

Grounder; Pseudo boolean constraints; SAT

Indexed keywords

BOOLEAN FUNCTIONS; CONSTRAINT THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

MODEL SEARCH PROBLEMS; PSEUDO-BOOLEAN CONSTRAINTS;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 33845224299     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. F.A. Aloul, A. Ramani, I. Markov and K. Sakallah, PBS: a backtrack-search pseudo-boolean solver and optimizer, in: Proceedings of the 5th International Symposium on Theory and Applications of Satisfiability, 2002, pp. 346-353.
2. P. Barth, A Davis-Putnam based elimination algorithm for linear pseudo-boolean optimization, Technical report, Max-Planck-Institut für Informatik, 1995, MPI-I-95-2-003.
3. B. Benhamou, L. Sais and P. Siegel, 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), Volume 775 of LNCS, Springer, 1994, pp. 71-82.
4. M. Cadoli and T. Mancini, Automated reformulation of specifications by safe delay of constraints, in: Proceedings of the 2nd International Workshop on Modelling and Reformulating Constmint Satisfaction Problems, A.M. Frisch, ed., 2003, pp. 33-47 (in conjunction with CP-2003).
5. M. Cadoli and A. Schaerf, Compiling problem specifications into SAT, in: Proceedings of the European Symposium On Programming (ESOP-2001), Volume 2028 of LNAI, Springer, 2001, pp. 387-401.
6. M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the Association for Computing Machinery 7 (1960), 201-215.
7. H.E. Dixon, M.L. Ginsberg and A.J. Parkes, Generalizing Boolean satisfiability I: Background and survey of existing work, Journal of Artificial Intelligence Research 21 (2004), 193-243.
8. D. East and M. Truszczyński. Aspps solver, version of 06/04/2003 (2003) http://www.cs.engr.uky.edu/ai/aspps/.
9. D. East and M. Truszczyński, Predicate-calculus based logics for modeling and solving search problems, ACM Transactions on Computational Logic, 2006. To appear, available at http://www.acm.org/tocl/accepted.html.
10. N. Eén and N. Sörensson, Translating pseudo-boolean constraints into SAT, Journal on Satisfiability, Boolean Modeling and Computation 2 (2006), 1-26.
11. M.L. Ginsberg and A.J. Parkes, Satisfiability algorithms and finite quantification, in: Proceedings of the 7th International Conference on Principles of Knowledge Representation and Reasoning, (KR-2000), Morgan Kaufmann, 2000, pp. 690-701.
12. GNU Project - Free Software Foundation, Bison, 2004, http://www.gnu.org/ software/bison/bison.html.
13. C.M. Li and M. Anbulagan, Heuristics based on unit propagation for satisfiability problems, in: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), Morgan Kaufmann, 1997, pp. 366-371.
14. L. Liu and M. Truszczyński, 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, F. Rossi, ed., Volume 2833 of LNCS, Springer, 2003, pp. 495-509.
15. L. Liu and M. Truszczyński, Wsatcc solver, version of 7/29/2005 (2005) http://www.cs.engr.uky.edu/ai/wsatcc/.
16. V. Manquinho and O. Roussel, The first evaluation of pseudo-boolean solvers (PB'05), Journal on Satisfiability, Boolean Modeling and Computation 2 (2006), 103-143.
17. Satisfiability Suggested Format Last revision: May 8, 1993 ftp://dimacs.rutgers.edu/pub/challenge/satisfiability/doc/ satformat.tex.
18. H. Sheini and K. Sakallah, Pueblo: A hybrid pseudo-boolean SAT solver, Journal on Satisfiability, Boolean Modeling and Computation 2 (2006), 165-189.
19. T. Syrjänen, lparse, a procedure for grounding domain restricted logic programs, http://www.tcs.hut.fi/Software/smodels/lparse/, 1999.