The automation of syllogistic. II: Optimization and complexity issues (Q1813824): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The automation of syllogistic. I: Syllogistic normal forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Optimal Control. A General Procedure for the Computation of Switching Manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Logically Simplest Form of the Infinity Axiom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability / rank
 
Normal rank

Revision as of 17:08, 14 May 2024

scientific article
Language Label Description Also known as
English
The automation of syllogistic. II: Optimization and complexity issues
scientific article

    Statements

    The automation of syllogistic. II: Optimization and complexity issues (English)
    0 references
    0 references
    25 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    model graphs
    0 references
    multilevel syllogistic
    0 references
    set-theoretic formulae
    0 references
    syllogistic schemes
    0 references
    searching algorithm
    0 references
    complexity
    0 references
    NP-complete
    0 references
    decision algorithm
    0 references
    0 references
    0 references