James J. Lu
ABSTRACT
A two-part approach for extending relational database systems to solve boolean constraint problems is presented. The first is a SQL-extension frontend for specifying boolean constraint problems, and the second is a coupling of constraint solvers with the database engine in the backend. The language extension is high-level and domain-specific, thereby allowing users to focus on writing specifications at the abstraction level of the problem domain. Both a stand-alone solver and a stored-procedure solver are integrated in the backend, and a simple approach for finding "acceptable answers" to overly-constrained problems is discussed. A prototype system is described along with an application to scheduling tennis matches.
- B. Aditya, G. Bhalotia, S. Chakrabarti, A. Hulgeri, C. Nakhe, and S. S. Parag. Banks: Browsing and keyword searching in relational databases. In Proceedings of VLDB, 2002. Google Scholar
Digital Library
- N. Eén and N. Sörensson. An extensible sat-solver. In SAT, pages 502--518, 2003.Google Scholar
- T. Eiter, J. J. Lu, T. Lukasiewicz, and V. S. Subrahmanian. Probabilistic object bases. ACM Trans. Database Syst., 26(3):264--312, 2001. Google ScholarDigital Library
- M. Ganai, L. Zhang, P. Ashar, A. Gupta, and S. Malik. Combining strengths of circuit-based and cnf-based algorithms for a high-performance sat solver. In Proceedings of ACM/IEEE Design Automation Conference, 2002. Google ScholarDigital Library
- J. Gray. The next database revolution. In SIGMOD Conference, pages 1--4, 2004. Google ScholarDigital Library
- J. Han and M. Kamber. Data mining: concepts and techniques. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2000. Google ScholarDigital Library
- D. Jackson. Alloy: a lightweight object modelling notation. ACM Trans. Softw. Eng. Methodol., 11(2):256--290, 2002. Google ScholarDigital Library
- H. A. Kautz and B. Selman. Planning as satisfiability. In Proceedings of the Tenth European Conference on Artificial Intelligence (ECAl'92), pages 359--363, 1992. Google ScholarDigital Library
- R. Ramakrishnan and J. D. Ullman. A survey of research on deductive database systems. Journal of Logic Programming, 23(2):125--149, 1993.Google ScholarCross Ref
- R. Reiter. On closed world data bases. In Logic and Data Bases, pages 55--76, 1977.Google Scholar
- B. Selman, H. J. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of AAAI, 1992.Google Scholar
- A. U. Tansel, J. Clifford, S. K. Gadia, A. Segev, and R. T. Snodgrass. Temporal Databases: Theory, Design, and Implementation. Benjamin/Cummings, 1993. Google ScholarDigital Library
- A. van Deursen, P. Klint, and J. Visser. Domain-specific languages: An annotated bibliography. ACM SIGPLAN Notices, 35(6):26--36, June 2000. Google ScholarDigital Library
- H. Zhang. Generating college conference basketball schedules by a sat solver. In Proceedings of International Symposium on Satisfiability, 2002.Google Scholar
- H. Zhang and M. Stickel. Implementing the davis-putnam procedure. Journal of Automated Reasoning, 24:277--296, 2000. Google ScholarDigital Library
Index Terms
- Specifying and solving Boolean constraint problems in relational databases: a case study
Recommendations
Solving dynamic constraint optimization problems using ICHEA
ICONIP'12: Proceedings of the 19th international conference on Neural Information Processing - Volume Part IIIMany real-world constrained problems have a set of predefined static constraints that can be solved by evolutionary algorithms (EAs) whereas some problems have dynamic constraints that may change over time or may be received by the problem solver at run ...
Solving conditional and composite constraint satisfaction problems
SAC '07: Proceedings of the 2007 ACM symposium on Applied computingConstraint Satisfaction Problems (CSPs) have been widely used to solve combinatorial problems. In order to deal with dynamic CSPs where the information regarding any possible change is known a priori and can thus be enumerated beforehand, conditional ...
Comments