Advertisement

Problem solving in the DISCO constraint database system

  • Peter Z. Revesz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1191)

Abstract

This paper describes general approaches to solving two classes of problems using the DISCO constraint database system. The first class of problems occurs when distinct values from a subset of the integers must be assigned to the variables of a constraint satisfaction problem. The second occurs when a group of items must be selected from a subset of the integers such that each of a set of constraints holds.

Keywords

Hamiltonian Cycle Constraint Satisfaction Problem Atomic Formula Conjunctive Normal Form Constraint Check 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Byon, P. Z. Revesz. DISCO: A Constraint Database System with Sets. Proc. Workshop on Constraint Databases and Applications, Springer-Verlag, LNCS 1034, pp. 68–83, September 1995.Google Scholar
  2. 2.
    A. Dovier, G. Rossi. Embedding extensional finite sets in CLP. International Logic Programming Symposium, 1993.Google Scholar
  3. 3.
    ECLIPSE. Eclipse user manual. Technical report. ECRC, 1994.Google Scholar
  4. 4.
    C. Gervet. Conjunto: Constraint Logic Programming with Finite Set Domains. Proc. International Logic Programming Symposium, 339–358, 1994.Google Scholar
  5. 5.
    P. C. Kanellakis, G. M. Kuper, P. Z. Revesz. Constraint Query Languages. Journal of Computer and System Sciences, vol. 51, 26–52, 1995.Google Scholar
  6. 6.
    G. M. Kuper. Logic Programming with Sets. Journal of Computer and System Sciences, vol. 41, 44–64, 1990.Google Scholar
  7. 7.
    B. Legeard, E. Legros. Short overview of the CLPS System. Proc. PLILP, 1991.Google Scholar
  8. 8.
    D. Pountain. Constraint Logic Programming. Byte, February 1995.Google Scholar
  9. 9.
    R. Ramakrishnan, D. Srivastava, S. Sudarshan. CORAL: Control, Relations and Logic. Proc. VLDB, 1992.Google Scholar
  10. 10.
    P. Z. Revesz. A Closed Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints, Theoretical Computer Science, vol. 116, no. 1, 117–149, 1993.Google Scholar
  11. 11.
    P. Z. Revesz. Datalog Queries of Set Constraint Databases, Fifth International Conference on Database Theory, Springer-Verlag LNCS 893, pp. 425–438, Prague, Czech Republic, January, 1995.Google Scholar
  12. 12.
    P. Z. Revesz. Safe Stratified Datalog with Integer Order Programs, First International Conference on Principles and Practice of Constraint Programming, Springer-Verlag LNCS 976, pp. 154–169, Cassis, September, 1995.Google Scholar
  13. 13.
    P. Z. Revesz. Genomic Database Applications in DISCO. CP96 Workshop on Constraints and Databases, Cambridge, Massachusetts, August, 1996.Google Scholar
  14. 14.
    D. Srivastava, R. Ramakrishnan, P.Z. Revesz. Constraint Objects. Proc. 2nd Workshop on Principles and Practice of Constraint Programming, 274–284, 1994.Google Scholar
  15. 15.
    S. Tsur and C. Zaniolo. LDL: A Logic-Based Data-Language. Proc. VLDB, pp 33–41, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Peter Z. Revesz
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of NebraskaLincolnUSA

Personalised recommendations