The automation of syllogistic I. Syllogistic normal forms

Authors:
Domenico Cantone;Susanna Ghelfo;Eugenio Omodeo
Affiliations:
Courant Institute, New York University, New York, U.S.A. and Universita' di Catania, Italy;Enidata, Bologna, Italy;Enidata, Bologna, Italy
Venue:
Journal of Symbolic Computation
Year:
1988

Citing 5
Cited 2

Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator

Journal of Computer and System Sciences
Towards Practical Implementations of Syllogistic

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Decision Procedures for Some Fragments of Set Theory

Proceedings of the 5th Conference on Automated Deduction
Simplifying Interpreted Formulas

Proceedings of the 5th Conference on Automated Deduction
Irredundant disjunctive and conjunctive forms of a Boolean function

IBM Journal of Research and Development

A derived algorithm for evaluating ε-expressions over abstract sets

Journal of Symbolic Computation - Special issue on automatic programming
Decidability results for sets with atoms

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

''Boole first put forth the problem of Logical Science in its complete generality: Given certain logical premisses or conditions, to determine the description of any class of objects under those conditions.''