„decidable theory“

Suchergebnisse

1.000+ Treffer

• A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics
  Cantone, Domenico ; Longo, Cristiano ; Nicolosi Asmundo, Marianna 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Lagrange's Theorem for Binary Squares
  Madhusudan, P. ; Nowotka, Dirk ; Rajasekaran, Aayush ; Shallit, Jeffrey O. 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Model Theory in Algebra, Analysis and Arithmetic – Cetraro, Italy 2012, Editors: H. Dugald Macpherson, Carlo Toffalori
  Dries, Lou ; Koenigsmann, Jochen ; Macpherson, Dugald ; Pillay, Anand ; Toffalori, Carlo ; Wilkie, Alex J. 2014 Springer Berlin Heidelberg
• Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
  Rydval, Jakub ; Baader, Franz ; Lutz, Carsten 2022 Technische Universität Dresden
• Reachability Problems – 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings
  2014 Springer International Publishing
• The Identity Problem in ℤ ≀ ℤ Is Decidable
  Dong, Ruiwen 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Characterization of Wreath Products Where Knapsack Is Decidable
  Bergsträßer, Pascal ; Ganardi, Moses ; Zetzsche, Georg 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• What Makes a Variant of Query Determinacy (Un)Decidable? (Invited Talk)
  Marcinkowski, Jerzy 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Equivalence of Finite-Valued Streaming String Transducers Is Decidable (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Muscholl, Anca ; Puppis, Gabriele 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Semantics of Intensional Type Theory extended with Decidable Equational Theories
  Wang, Qian ; Barras, Bruno 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable
  Kufleitner, Manfred ; Lauser, Alexander 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The FO2 alternation hierarchy is decidable
  Kufleitner, Manfred ; Weil, Pascal 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Two decidable classes of formulas of the modal logic S5
  Norgėla, S.
• A Practical Decision Procedure for Quantifier-Free, Decidable Languages Extended with Restricted Quantifiers
  Cristiá, Maximiliano ; Rossi, Gianfranco
• Decidable Regression Techniques for Statistical Modelling with Sustainable Agriculture Operations
  Nair, Sanjith Bharatharajan ; Al-Hemyari, Zuhair A. ; Gountia, Debasis
• Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms
  Bala, Sebastian
• It is decidable whether a monadic thue system is canonical over a regular set
  Narendran, Paliath
• Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables
  Arnold, A. ; Dauchet, M.
• The equivalence of deterministic gsm replications onQ-rational languages is decidable
  Turakainen, Paavo
• The equivalence of pre-NTS grammars is decidable
  Autebert, J. -M ; Boasson, L.