The automation of syllogistic. II: Optimization and complexity issues

DOI10.1007/BF00245817zbMath0744.03015OpenAlexW2025586204MaRDI QIDQ1813824

Alberto Policriti, Eugenio Giovanni Omodeo, Domenico Cantone

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

complexityNP-completedecision algorithmsearching algorithmmodel graphsmultilevel syllogisticset-theoretic formulaesyllogistic schemes

Mathematics Subject Classification ID

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

Related Items (8)

A set-theoretic translation method for polymodal logics ⋮ A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions1 1This research has been partially supported by MURST Grant prot. 2001017741 under project “Ragionamento su aggregati e numeri a supporto della programmazione e relative verifiche”. ⋮ Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages ⋮ Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership ⋮ Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini ⋮ Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* ⋮ Goals and benchmarks for automated map reasoning ⋮ A tableau-based decision procedure for a fragment of set theory with iterated membership

Cites Work

• Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
• The automation of syllogistic. I: Syllogistic normal forms
• Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
• The Logically Simplest Form of the Infinity Axiom
• Contributions to the Theory of Optimal Control. A General Procedure for the Computation of Switching Manifolds
• Unnamed Item
• Unnamed Item

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