Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
68 | Qing Zhou, Weihao Hu |
Decidability in Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 75(4), pp. 319-336, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
almost decidable, Decidable |
53 | Dietrich Kuske, Markus Lohrey |
Decidable Theories of Cayley-Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 463-474, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
49 | Amir Pnueli, Roni Rosner |
Distributed Reactive Systems Are Hard to Synthesize ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 746-757, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
elementarily decidable, distributed reactive system, propositional specification, nonelementarily decidable, distributed architecture, undecidable, finite-state |
47 | Mikolaj Bojanczyk, Piotr Hoffman |
Reachability in Unions of Commutative Rewriting Systems Is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 622-633, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Topic classification Logic in computer science, rewriting |
40 | Friedrich Otto, Masashi Katsura, Yuji Kobayashi |
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings, pp. 53-67, 1997, Springer, 3-540-62950-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
40 | Christian Prehofer |
Decidable Higher-Order Unification Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26 - July 1, 1994, Proceedings, pp. 635-649, 1994, Springer, 3-540-58156-1. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
39 | Limin Jia 0001, Jianzhou Zhao, Vilhelm Sjöberg, Stephanie Weirich |
Dependent types and program equivalence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, January 17-23, 2010, pp. 275-286, 2010, ACM, 978-1-60558-479-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
dependent types, program equivalence |
39 | Thomas A. Henzinger, Jean-François Raskin, Pierre-Yves Schobbens |
The Regular Real-Time Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings, pp. 580-591, 1998, Springer, 3-540-64781-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
39 | Neil D. Jones, Steven S. Muchnick |
Even Simple Programs are Hard to Analyze. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Second ACM Symposium on Principles of Programming Languages, Palo Alto, California, USA, January 1975, pp. 106-118, 1975, ACM Press. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
34 | Tony Tan |
On Pebble Automata for Data Languages with Decidable Emptiness Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 712-723, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Barbara F. Csima, Bakhadyr Khoussainov |
When Is Reachability Intrinsically Decidable?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings, pp. 216-227, 2008, Springer, 978-3-540-85779-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sagiv |
Decidable Fragments of Many-Sorted Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings, pp. 17-31, 2007, Springer, 978-3-540-75558-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Thomas Ågotnes, Natasha Alechina |
Full and relative awareness: a decidable logic for reasoning about knowledge of unawareness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TARK ![In: Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), Brussels, Belgium, June 25-27, 2007, pp. 6-14, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier |
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings, pp. 69-83, 2007, Springer, 978-3-540-72732-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Joël Ouaknine, James Worrell 0001 |
Safety Metric Temporal Logic Is Fully Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 12th International Conference, TACAS 2006 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006, Proceedings, pp. 411-425, 2006, Springer, 3-540-33056-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Nicolas Peltier |
Representing and Building Models for Decidable Subclasses of Equational Clausal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 33(2), pp. 133-170, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
resolution, decision procedure, model building, model representation |
34 | Pavel Krcál, Wang Yi 0001 |
Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings, pp. 236-250, 2004, Springer, 3-540-21299-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Diego Calvanese, Giuseppe De Giacomo, Moshe Y. Vardi |
Decidable Containment of Recursive Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2003, 9th International Conference, Siena, Italy, January 8-10, 2003, Proceedings, pp. 327-342, 2003, Springer, 3-540-00323-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
34 | Krysia Broda |
A Decidable CLDS for Some Propositional Resource Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computational Logic: Logic Programming and Beyond ![In: Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II, pp. 135-159, 2002, Springer, 3-540-43960-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Regimantas Pliuskevicius |
On an omega-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computational Logic ![In: Computational Logic - CL 2000, First International Conference, London, UK, 24-28 July, 2000, Proceedings, pp. 523-537, 2000, Springer, 3-540-67797-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
34 | Manfred Schmidt-Schauß, Klaus U. Schulz |
Solvability of Context Equations with Two Context Variables is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-16, 16th International Conference on Automated Deduction, Trento, Italy, July 7-10, 1999, Proceedings, pp. 67-81, 1999, Springer, 3-540-66222-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Jordi Levy |
Decidable and Undecidable Second-Order Unification Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings, pp. 47-60, 1998, Springer, 3-540-64301-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
34 | Florent Jacquemard |
Decidable Approximations of Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 7th International Conference, RTA-96, New Brunswick, NJ, USA, July 27-30, 1996, Proceedings, pp. 362-376, 1996, Springer, 3-540-61464-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
34 | Helmut Seidl |
Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings, pp. 269-284, 1990, Springer, 3-540-52590-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
32 | Laurent Bienvenu, Wolfgang Merkle |
Reconciling Data Compression and Kolmogorov Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 643-654, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Markus Lohrey, Géraud Sénizergues |
Theories of HNN-Extensions and Amalgamated Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II, pp. 504-515, 2006, Springer, 3-540-35907-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Bakhadyr Khoussainov, Sasha Rubin |
Decidability of Term Algebras Extending Partial Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings, pp. 292-308, 2005, Springer, 3-540-28231-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Ralf H. Reussner |
Counter-Constrained Finite State Machines: A New Model for Component Protocols with Resource-Dependencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2002: Theory and Practice of Informatics, 29th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 22-29, 2002, Proceedings, pp. 20-40, 2002, Springer, 3-540-00145-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
software component protocols, finite state machine extension, decidable inclusion check, interoperability, substitutability |
31 | Mihhail Matskin, Enn Tyugu |
Strategies of Structural Synthesis of Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: 1997 International Conference on Automated Software Engineering, ASE 1997, Lake Tahoe, CA, USA, November 2-5, 1997, pp. 305-306, 1997, IEEE Computer Society, 0-8186-7961-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
structural program synthesis strategies, deductive program synthesis method, compositional programming, decidable logical calculus, PSPACE complexity, independent subtasks, iteration synthesis, regular data structures, heuristics, programming environments, structured programming, proof search, search efficiency |
29 | Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo |
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 954, pp. 113786, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
29 | Bruno Bernardo |
Un Calcul des Constructions implicite avec sommes dépendantes et à inférence de type décidable. (An implicit Calculus of Constructions with dependent sums and decidable type inference). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2015 |
RDF |
|
29 | Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi |
What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2012 - Concurrency Theory - 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4-7, 2012. Proceedings, pp. 193-208, 2012, Springer, 978-3-642-32939-5. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
29 | René Vidal, Shawn Schaffert, Omid Shakernia, John Lygeros, Shankar Sastry 0001 |
Decidable and semi-decidable controller synthesis for classes of discrete time hybrid systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 40th IEEE Conference on Decision and Control, CDC 2001, Orlando, FL, USA, 4-7 Dec., 2001, pp. 1243-1248, 2001, IEEE, 0-7803-7061-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Natasha Alechina |
On a Decidable Generalized Quantifier Logic Corresponding to a Decidable Fragment of First-Order Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 4(3), pp. 177-189, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
29 | Terrence Millar |
A Complete, Decidable Theory with Two Decidable Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 44(3), pp. 307-312, 1979. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
28 | Kenneth L. Knowles, Cormac Flanagan |
Compositional reasoning and decidable checking for dependent contract types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLPV ![In: Proceedings of the 3rd ACM Workshop Programming Languages meets Program Verification, PLPV 2009, Savannah, GA, USA, January 20, 2009, pp. 27-38, 2009, ACM, 978-1-60558-330-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
refinement types, abstraction, dependent types, compositional reasoning |
28 | Jacques Duparc, Alessandro Facchini, Filip Murlak |
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings, pp. 225-239, 2009, Springer, 978-3-642-04026-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Albert Atserias, Mark Weyer |
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings, pp. 102-116, 2009, Springer, 978-3-642-04026-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Pascal Fontaine |
Combinations of Theories for Decidable Fragments of First-Order Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FroCoS ![In: Frontiers of Combining Systems, 7th International Symposium, FroCoS 2009, Trento, Italy, September 16-18, 2009. Proceedings, pp. 263-278, 2009, Springer, 978-3-642-04221-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Alberto Casagrande, Pietro Corvaja, Carla Piazza, Bud Mishra |
Decidable Compositions of O-Minimal Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 6th International Symposium, ATVA 2008, Seoul, Korea, October 20-23, 2008. Proceedings, pp. 274-288, 2008, Springer, 978-3-540-88386-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Peter Habermehl, Radu Iosif, Tomás Vojnar |
What Else Is Decidable about Integer Arrays?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings, pp. 474-489, 2008, Springer, 978-3-540-78497-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Matthew J. Patitz, Scott M. Summers |
Self-assembly of Decidable Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UC ![In: Unconventional Computing, 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008. Proceedings, pp. 206-219, 2008, Springer, 978-3-540-85193-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Norihiro Kamide |
Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence, 11th European Conference, JELIA 2008, Dresden, Germany, September 28 - October 1, 2008. Proceedings, pp. 245-257, 2008, Springer, 978-3-540-87802-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Yoshiharu Kojima, Masahiko Sakai |
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings, pp. 187-201, 2008, Springer, 978-3-540-70588-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Brad Lushman, Gordon V. Cormack |
A larger decidable semiunification problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 14-16, 2007, Wroclaw, Poland, pp. 143-152, 2007, ACM, 978-1-59593-769-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
acyclic semiunification, semiunification, decidability |
28 | Francesco Calimeri, Susanna Cozza, Giovambattista Ianni |
Decidable Fragments of Logic Programming with Value Invention. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence, 10th European Conference, JELIA 2006, Liverpool, UK, September 13-15, 2006, Proceedings, pp. 95-110, 2006, Springer, 3-540-39625-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Pietro di Lena |
Decidable Properties for Regular Cellular Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), IFIP 19th World Computer Congress, TC-1 Foundations of Computer Science, August 23-24, 2006, Santiago, Chile, pp. 185-196, 2006, Springer, 0-387-34633-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Dietrich Kuske, Markus Lohrey |
Decidable First-Order Theories of One-Step Rewriting in Trace Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(1), pp. 39-81, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Manfred Schmidt-Schauß |
Decidable Variants of Higher-Order Unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mechanizing Mathematical Reasoning ![In: Mechanizing Mathematical Reasoning, Essays in Honor of Jörg H. Siekmann on the Occasion of His 60th Birthday, pp. 154-168, 2005, Springer, 3-540-25051-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Jon A. Solworth, Robert H. Sloan |
A Layered Design of Discretionary Access Controls with Decidable Safety Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
S&P ![In: 2004 IEEE Symposium on Security and Privacy (S&P 2004), 9-12 May 2004, Berkeley, CA, USA, pp. 56-, 2004, IEEE Computer Society, 0-7695-2136-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Viktor Kuncak, Martin C. Rinard |
Structural Subtyping of Non-Recursive Types is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22-25 June 2003, Ottawa, Canada, Proceedings, pp. 96-107, 2003, IEEE Computer Society, 0-7695-1884-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Jesse D. Bingham, Anne Condon, Alan J. Hu |
Toward a decidable notion of sequential consistency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 304-313, 2003, ACM, 1-58113-661-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
shared memory systems, memory model, sequential consistency |
28 | Michaël Adélaïde, Olivier F. Roux |
A Class of Decidable Parametric Hybrid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMAST ![In: Algebraic Methodology and Software Technology, 9th International Conference, AMAST 2002, Saint-Gilles-les-Bains, Reunion Island, France, September 9-13, 2002, Proceedings, pp. 132-146, 2002, Springer, 3-540-44144-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Thomas Colcombet |
On Families of Graphs Having a Decidable First Order Theory with Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 98-109, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Volker Diekert, Anca Muscholl |
Solvability of Equations in Free Partially Commutative Groups Is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 543-554, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer |
Conter Machines: Decidable Properties and Applications to Verification Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings, pp. 426-435, 2000, Springer, 3-540-67901-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Paliath Narendran, Michaël Rusinowitch |
The Theory of Total Unary RPO Is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computational Logic ![In: Computational Logic - CL 2000, First International Conference, London, UK, 24-28 July, 2000, Proceedings, pp. 660-672, 2000, Springer, 3-540-67797-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
recursive path ordering, ground reducibility, ordered rewriting, tree automata, first-order theory |
28 | Yoram Hirshfeld, Alexander Moshe Rabinovich |
A Framework for Decidable Metrical Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 422-432, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Adriana Popovici, Dan Popovici |
delta-Uniformly Decidable Sets and Turing Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings, pp. 433-440, 1999, Springer, 3-540-66412-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Franz Baader, Ralf Molitor, Stephan Tobies |
Tractable and Decidable Fragments of Conceptual Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Standards and Practices, 7th International Conference on Conceptual Structures, ICCS '99, Blacksburg, Virginia, USA, July 12-15, 1999, Proceedings, pp. 480-493, 1999, Springer, 3-540-66223-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Reinhard Pichler |
Extending Decidable Clause Classes via Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTP (LNCS Selection) ![In: Automated Deduction in Classical and Non-Classical Logics, Selected Papers, pp. 206-220, 1998, Springer, 3-540-67190-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Sergei G. Vorobyov |
The "Hardest" Natural Decidable Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997, pp. 294-305, 1997, IEEE Computer Society, 0-8186-7925-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Erich Grädel, Martin Otto 0001, Eric Rosen |
Two-Variable Logic with Counting is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997, pp. 306-317, 1997, IEEE Computer Society, 0-8186-7925-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Petr Jancar |
Bisimulation Equivalence is Decidable for One-Counter Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings, pp. 549-559, 1997, Springer, 3-540-63165-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | D. J. B. Bosscher, W. O. David Griffioen |
Regularity for a Large Class of Context-Free Processes is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings, pp. 182-193, 1996, Springer, 3-540-61440-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Christoph Weidenbach |
Unification in Pseudo-Linear Sort Theories is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30 - August 3, 1996, Proceedings, pp. 343-357, 1996, Springer, 3-540-61511-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Søren Christensen |
Distributed Bisimularity is Decidable for a Class of Infinite State-Space Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR '92, Third International Conference on Concurrency Theory, Stony Brook, NY, USA, August 24-27, 1992, Proceedings, pp. 148-161, 1992, Springer, 3-540-55822-5. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
28 | Sophie Tison |
Fair Termination is Decidable for Ground Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings, pp. 462-476, 1989, Springer, 3-540-51081-8. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
28 | Paavo Turakainen |
The Equivalence of DGSM Replications on Q-Rational Languages is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 654-666, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
28 | Jeffrey F. Naughton, Yehoshua Sagiv |
A Decidable Class of Bounded Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 23-25, 1987, San Diego, California, USA, pp. 227-236, 1987, ACM, 0-89791-223-3. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
28 | Karel Culík II, Juhani Karhumäki |
The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings, pp. 264-272, 1986, Springer, 3-540-16783-8. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
28 | Jacob Gonczaroski |
Decidable Properties of Monadic Recursive Schemas with a Depth Parameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings, pp. 236-254, 1983, Springer, 3-540-12727-5. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
28 | Edward A. Ashcroft, Zohar Manna, Amir Pnueli |
Decidable Properties of Monadic Functional Schemas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 20(3), pp. 489-499, 1973. The full citation details ...](Pics/full.jpeg) |
1973 |
DBLP DOI BibTeX RDF |
|
26 | Laurent Doyen 0001, Gilles Geeraerts, Jean-François Raskin, Julien Reichert |
Realizability of Real-Time Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems, 7th International Conference, FORMATS 2009, Budapest, Hungary, September 14-16, 2009. Proceedings, pp. 133-148, 2009, Springer, 978-3-642-04367-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Salvatore La Torre, P. Madhusudan, Gennaro Parlato |
Context-Bounded Analysis of Concurrent Queue Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings, pp. 299-314, 2008, Springer, 978-3-540-78799-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Piotr Hoffman |
Unions of Equational Monadic Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings, pp. 81-95, 2006, Springer, 3-540-36834-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Efrat Jaeger, Nissim Francez, Shuly Wintner |
Unification Grammars and Off-Line Parsability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 14(2), pp. 199-234, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
off-line parsability, parsing termination, unification grammars |
26 | Yoshihito Toyama |
Reduction Strategies for Left-Linear Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Processes, Terms and Cycles ![In: Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday, pp. 198-223, 2005, Springer, 3-540-30911-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Venkatesh Mysore, Amir Pnueli |
Refining the Undecidability Frontier of Hybrid Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings, pp. 261-272, 2005, Springer, 3-540-30495-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Boris Motik, Ulrike Sattler, Rudi Studer |
Query Answering for OWL-DL with Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISWC ![In: The Semantic Web - ISWC 2004: Third International Semantic Web Conference,Hiroshima, Japan, November 7-11, 2004. Proceedings, pp. 549-563, 2004, Springer, 3-540-23798-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Olivier Serre |
Games with Winning Conditions of High Borel Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 1150-1162, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Borel Complexity, Pushdown Automata, Two-player Games |
26 | Lila Kari, Stavros Konstantinidis, Petr Sosík |
Bond-Free Languages: Formalizations, Maximality and Construction Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNA ![In: DNA Computing, 10th International Workshop on DNA Computing, DNA 10, Milan, Italy, June 7-10, 2004, Revised Selected Papers, pp. 169-181, 2004, Springer, 3-540-26174-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Takashi Nagaya, Yoshihito Toyama |
Decidability for Left-Linaer Growing Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 256-270, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
26 | Andrea Sattler-Klein |
New Undecidablility Results for Finitely Presented Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings, pp. 68-82, 1997, Springer, 3-540-62950-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Isabelle Fagnot |
On the Subword Equivalence Problem for Infinite Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 107-118, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
26 | Ke Wang |
Some Positive Results for Boundedness of Multiple Recursive Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT'95, 5th International Conference, Prague, Czech Republic, January 11-13, 1995, Proceedings, pp. 383-396, 1995, Springer, 3-540-58907-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
26 | Mahesh Girkar, Robert Moll |
New Results on the Analysis of Concurrent Systems with an Infinite Number of Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR '94, Concurrency Theory, 5th International Conference, Uppsala, Sweden, August 22-25, 1994, Proceedings, pp. 65-80, 1994, Springer, 3-540-58329-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Oscar H. Ibarra, Tao Jiang 0001, Nicholas Q. Trân, Hui Wang 0008 |
New Decidability Results Concerning Two-way Counter Machines and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings, pp. 313-324, 1993, Springer, 3-540-56939-1. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
26 | Ravindran Kannan, Richard J. Lipton |
Polynomial-time algorithm for the orbit problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 33(4), pp. 808-821, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
26 | Mohamed G. Gouda, Louis E. Rosier |
Communicating Finite State Machines with Priority Channnels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium, July 16-20, 1984, Proceedings, pp. 209-221, 1984, Springer, 3-540-13345-3. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
24 | I. D. Zaslavsky |
Some Criteria of Decidability for Axiomatic Systems in Three-Valued Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TbiLLC ![In: Logic, Language, and Computation, 6th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2005, Batumi, Georgia, September 12-16, 2005. Revised Selected Papers, pp. 247-259, 2005, Springer, 978-3-540-75143-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
three-valued predicate, Luk-theory, Luk-consistent theory, Lukcomplete theory, Luk-decidable theory |
24 | Ian Pratt-Hartmann |
Fragments of Language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 13(2), pp. 207-223, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
decidable fragments, computational complexity, semantics, logic |
24 | Susan Landau 0001 |
Simplification of Nested Radicals ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 314-319, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
radical simplification, nested radicals, equivalent expression, minimum nesting depth, decidable, minimal polynomial |
24 | Martín Abadi, Joseph Y. Halpern |
Decidability and Expressiveness for First-Order Logics of Probability (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 148-153, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
unary predicates, validity problem, binary predicate, elementary analysis, function symbols, probability, language, reasoning, first-order logics, decidable, expressiveness, domain, possible worlds |
24 | Leszek Pacholski, Wieslaw Szwast |
The 0-1 Law Fails for the Class of Existential Second Order Gödel Sentences with Equality ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 160-163, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
prenex first-order sentences, second order Godel sentences, 0-1 law, Bernays-Schonfinkel, Ackermann prefix classes, decidable cases |
24 | Russell Impagliazzo, Gábor Tardos |
Decision Versus Search Problems in Super-Polynomial Time ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 222-227, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
X-search problem, super-polynomial time, decidable, search problems, decision problems, parallel complexity |
21 | Ken Kaneiwa, Philip H. P. Nguyen |
Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISWC ![In: The Semantic Web - ISWC 2009, 8th International Semantic Web Conference, ISWC 2009, Chantilly, VA, USA, October 25-29, 2009. Proceedings, pp. 328-343, 2009, Springer, 978-3-642-04929-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Thomas Place, Luc Segoufin |
A Decidable Characterization of Locally Testable Tree Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, pp. 285-296, 2009, Springer, 978-3-642-02929-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Raphaël Bailly, François Denis |
Absolute Convergence of Rational Series Is Semi-decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings, pp. 117-128, 2009, Springer, 978-3-642-00981-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Yuliya Lierler, Vladimir Lifschitz |
One More Decidable Class of Finitely Ground Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009. Proceedings, pp. 489-493, 2009, Springer, 978-3-642-02845-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|