Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership-Reference-Cited by-同舟云学术

Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership

Published:2020-12 Issue: Volume:848 Page:28-46
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Cantone Domenico,Maugeri Pietro,Omodeo Eugenio G.^ORCID

Funder

Università degli Studi di Catania

INdAM-GNCS

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

1. The Design and Analysis of Computer Algorithms;Aho,1974

2. Embedding Boolean expressions into logic programming;Büttner;J. Symb. Comput.,1987

3. Decision procedures for elementary sublanguages of set theory. X. Multilevel syllogistic extended by the singleton and powerset operators;Cantone;J. Automat. Reason.,1991

4. Polynomial-time satisfiability tests for Boolean fragments of set theory;Cantone,2019

5. Computable Set Theory;Cantone,1989

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator;ACM Transactions on Computational Logic;2024-01-16

2. Onset and Today’s Perspectives of Multilevel Syllogistic;Lecture Notes in Computer Science;2024

3. The Decision Problem for Undirected Graphs with Reachability and Acyclicity;Lecture Notes in Computer Science;2024

4. Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages;Theoretical Computer Science;2023-04

5. Complexity Assessments for Decidable Fragments of Set Theory. IV: Testers for Crucial, Polynomial-Maximal Decidable Boolean Languages;SSRN Electronic Journal;2022