Deciding $$\mathsf {ATL^*}$$ Satisfiability by Tableaux (Q3454093): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-21401-6_14
+Normal rank
@@ Property / OpenAlex ID @@
+W1454650980
@@ Property / OpenAlex ID: W1454650980 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating-time temporal logic
@@ Property / cites work: Alternating-time temporal logic / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+
+Normal rank
@@ Property / cites work @@
+$\mathcal{EL}$ -ifying Ontologies
@@ Property / cites work: $\mathcal{EL}$ -ifying Ontologies / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385542
@@ Property / cites work: Q4385542 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding full branching time logic
@@ Property / cites work: Deciding full branching time logic / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed methods for fourth-order elliptic and parabolic problems using radial basis functions
+Normal rank
@@ Property / cites work @@
+Q4992506
@@ Property / cites work: Q4992506 / rank @@
+Normal rank
@@ Property / cites work @@
+ATL* Satisfiability Is 2EXPTIME-Complete
@@ Property / cites work: ATL* Satisfiability Is 2EXPTIME-Complete / rank @@
+Normal rank