On the computational complexity of satisfiability in propositional logics of programs (Q1170028): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(89)90083-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2047769025
@@ Property / OpenAlex ID: W2047769025 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Completeness Proofs for Some Logics of Programs
@@ Property / cites work: Completeness Proofs for Some Logics of Programs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Decidability of Propositional Algorithmic Logic
+Normal rank
@@ Property / cites work @@
+Propositional dynamic logic of regular programs
@@ Property / cites work: Propositional dynamic logic of regular programs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q4047108
@@ Property / cites work: Q4047108 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4164784
@@ Property / cites work: Q4164784 / rank @@
+Normal rank
@@ Property / cites work @@
+A near-optimal method for reasoning about action
@@ Property / cites work: A near-optimal method for reasoning about action / rank @@
+Normal rank
@@ Property / cites work @@
+Q5596237
@@ Property / cites work: Q5596237 / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Decision complexity of variants of propositional dynamic logic
+Normal rank