Quantitative Set Reasoning

  • Domenico Cantone
  • Eugenio Omodeo
  • Alberto Policriti
Part of the Monographs in Computer Science book series (MCS)


In Section 6.1.4, we examined techniques for translating the propositional consistency problem into decidable subproblems of the set-satisfiability problem; we also saw, in Sections 6.1.3 and 6.3.2, techniques for translating Hilbert’s tenth problem into more general instances of the set-satisfiability problem. The main purpose there was to detect limitations (lower complexity bounds which in special cases yield undecidability) opposing the solution of the set-satisfiability problem.


Integer Linear Program Logic Programming Integer Variable Atomic Formula Integer Linear Program Problem 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Domenico Cantone
    • 1
  • Eugenio Omodeo
    • 2
  • Alberto Policriti
    • 3
  1. 1.Dipartimento di Matematica e InformaticaUniversità di CataniaCataniaItaly
  2. 2.Dipartimento di Matematica Pura e ApplicataUniversità di L’AquilaL’AquilaItaly
  3. 3.Dipartimento di Matematica e InformaticaUniversità degli Studi di UdineUdineItaly

Personalised recommendations