The automation of syllogistic. II: Optimization and complexity issues

DOI10.1007/BF00245817MaRDI QIDQ1813824zbMATH OpenOpenAlexFDO

Authors Domenico Cantone, Eugenio Omodeo, Alberto Policriti

Publication date 25 June 1992

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00245817

zbMATH Keywords

complexitydecision algorithmmodel graphsmultilevel syllogisticNP-completesearching algorithmset-theoretic formulaesyllogistic schemes

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Foundations of classical theories (including reverse mathematics) (03B30) Mechanization of proofs and logical operations (03B35) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3983142
• scientific article; zbMATH DE number 1263308
• Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator
• Publication:3475242
• On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics

Cites work

• Contributions to the Theory of Optimal Control. A General Procedure for the Computation of Switching Manifolds
• Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
• Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
• scientific article; zbMATH DE number 3983142 (Why is no real title available?)
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• The automation of syllogistic. I: Syllogistic normal forms
• The Logically Simplest Form of the Infinity Axiom

Cited in

(14)

• The automation of syllogistic. I: Syllogistic normal forms
• A set-theoretic translation method for polymodal logics
• Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership
• Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages
• scientific article; zbMATH DE number 3983142 (Why is no real title available?)
• Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini
• A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions
• Complexity assessments for decidable fragments of set theory. I: A taxonomy for the Boolean case
• Goals and benchmarks for automated map reasoning
• Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory
• On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework
• Mechanizing Logic. II: Automated map logic method for relational arguments on paper and by computer
• A tableau-based decision procedure for a fragment of set theory with iterated membership
• Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited

This page was built for publication: The automation of syllogistic. II: Optimization and complexity issues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813824)