Skip to main content
SpringerLink
Log in

Deciding in HFS-theory via linear integer programming

  • Conference paper
  • First Online:
Logic Programming and Automated Reasoning (LPAR 1993)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 698))

Abstract

We give a reduction, in polynomialy bounded time, of the satisfiability problem in the set language MPLS, to an equivalent linear integer programming problem. We show that this provides an algorithm to decide the Set Unification Problem. The procedure performed gives the eventual unifiers of two set terms (i.e. at least a minimal exhaustive collection of unifiers) in “compact form”. The unifiers are given via the solutions of a linear integer system generated by the reduction. We also report further results concerning the construction of models over the atoms of the universe HFSA (the set model conceived here). These predict the number of useful atoms needed to produce a model of formulae involving the negation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho,J. E. Hopcroft and J.D Ullman, Data Structures and Algorithms, Addison-Wesley, Reading, Mass. (1983).

    Google Scholar 

  2. K.R Apt, Logic Programming, in Handbook of Theoretical Computer Science, J.van Leeuwen ed., Elsevier Science Publishers 90.

    Google Scholar 

  3. J. Barwise, Admissible Sets and Structures, Perspectives in Mathematical Logic, Springer-Verlag, 1975.

    Google Scholar 

  4. C. Beeri, S. Naqvi, R. Ramakrishnan, O. Shmueli, S. Tsur, Sets and negation in a logic database language (LDL1), Proceedings of the 6th Annual ACM SIGMOD Symposium on principles of Database Systems, Vol 16, n3, pp 21–37, 1987.

    Article  Google Scholar 

  5. W. Büttner, Unification in Data Structure Multisets, Journal of Automated Reasoning 2, (1986), 75–88.

    Article  Google Scholar 

  6. M. Dincbas, P. Van Henteryck, H. Simonis, A. Aggoun, T. Graf, F.Berthier, The Constraint Logic Programming Language CHIP, Proceeding of the International Conference on Fifth Genaration Computer System (Tokyo 88).

    Google Scholar 

  7. D. Cantone, E. Omodeo and A. Policriti, The Automation of Syllogistic II. Optimization and Complexity Issues. Journal of Automated Reasoning, 6: 173–187, 1990.

    Article  Google Scholar 

  8. A. Dovier, E. Omodeo, E Pontelli and G.F. Rossi, : A Logic Programming Language With Finite Sets, Proceedings of The Eighth International Conference in Logic Programming, (K. Furukawa, ed), The MIT Press, 1991, p111–124.

    Google Scholar 

  9. A. Dovier, E. Pontelli, Logic Programming With Sets, (en italien), Tesi di Laurea, University of Udine 1990.

    Google Scholar 

  10. A. Ferro, D. Cantone, E. Omodeo, Computable Set Theory, Academic Press 1990.

    Google Scholar 

  11. M. Hibti, Satisfiabilité dans Certains Langages Ensemblistes; Actes de La Journée Ensemble, Rapport de recherche LIFO Orléans 9 Avril 92.

    Google Scholar 

  12. M. Hibti, H. Lombardi and B. Legeard, Deciding in HFS-Theory via Linear Integer Programming with application to Set unification, (Detailled version) Technical Report, LAB 93-04, Université de Franche-Compté, 1993.

    Google Scholar 

  13. D. Kapur and P. Narendren, NP-Completeness of The set Unification and Matching Problems, Proc. of the ICAD, Oxford, July 1986, Springer LNCS 230, 489–495.

    Google Scholar 

  14. G.M. Kuper, Logic Programming with Sets, Research Report IBM Yorktown Heights, RC 12378, Dec. 1987.

    Google Scholar 

  15. B. Legeard, E. Legros, Short overview of the CLPS system, Proceedings of the 3rd International Symposium on Programming Language Implementation and Logic Programming, PLILP'91, pp 431–433, Passau, Germany, August 1991.

    Google Scholar 

  16. B. Legeard, H. Lombardi, E. Legros and M. Hibti A Satisfaction Approach to Set Unification, to appear in Proceedings of the 13th International Conference on Artificial Intelligence, Expert Systems and Natural Language, EC2, Avignon, May 24–28, 1993.

    Google Scholar 

  17. E. Omodeo, A. Policriti and F. Parlamento, Decidability of∃*∀-Sentences in Membership Theories, Reaserch Report Nr6, University of Udine May 92.

    Google Scholar 

  18. K.J. Perry, K.V. Palem, K. McAloon, G.M Kuper, The Complexity of Logic Programming with Sets, Research Report IBM Yorktown Heights, RC 12887, 1987.

    Google Scholar 

  19. J. H. Siekmann, Unification Theory, In Unification, Edited by C. Kirchner, Academic Press, pp 1–68, 1990.

    Google Scholar 

  20. R. Sigal, Desiderata for Logic Programming with Sets, GULP, Proceedings of the 4th National Conference on Logic Programming, pp 127–141, Bologna, 1989.

    Google Scholar 

  21. Y. Sato, S. Menju and K. Sakai, Solving constraint over sets by Groebner Bases. Technical Report TR-680, ICOT, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Automatique, Institut de Productique, 15 Impasse des St Martins, 25000, Besançon, France

    M. Hibti & B. Legeard

  2. Laboratoire de Mathématique, UFR des sciences et Techniques, 25030, cedex Besançon, France

    H. Lombardi

Authors
  1. M. Hibti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Lombardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. Legeard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hibti, M., Lombardi, H., Legeard, B. (1993). Deciding in HFS-theory via linear integer programming. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1993. Lecture Notes in Computer Science, vol 698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56944-8_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-56944-8_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56944-2

  • Online ISBN: 978-3-540-47830-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation