Pages that link to "Item:Q1813824"
From MaRDI portal
The following pages link to The automation of syllogistic. II: Optimization and complexity issues (Q1813824):
Displaying 9 items.
- A tableau-based decision procedure for a fragment of set theory with iterated membership (Q812437) (← links)
- A set-theoretic translation method for polymodal logics (Q1904398) (← links)
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960) (← links)
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini (Q4361575) (← links)
- 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 del (Q4916221) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
- Goals and benchmarks for automated map reasoning (Q5927984) (← links)
- On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework (Q6649524) (← links)
