(*) A Syllogistic Solitaire

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


In the very prototypical form in which they were originally conceived, some of the decision algorithms for set contexts proceed by blind search. They do this so exhaustively over a large space as to baffle any implementation attempt aimed at efficiency. One would at least expect clarity to be a reward to low efficiency; but such decision algorithms often are somewhat hard to understand and even harder to extend with the treatment of settheoretical constructs that were not built into them from the outset. In this chapter, we re-examine one of them, with two goals in mind: one is to make a tough decidability result easier to understand, another is to bring it closer to extensions some of which have been attained only recently.


Computable Function Decision Algorithm Satisfiability Problem Finite Collection Trace Theorem 
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