Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cantone, D., Omodeo, E., Policriti, A. (2001). (*) A Syllogistic Solitaire. In: Set Theory for Computing. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3452-2_9
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3452-2_9
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2905-1
Online ISBN: 978-1-4757-3452-2
eBook Packages: Springer Book Archive