Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
163 | Anthony J. Dunlop, Marian Boykan Pour-El |
The Degree of Unsolvability of a Real Number. |
CCA |
2000 |
DBLP DOI BibTeX RDF |
|
59 | Dennis F. Cudia, Wilson E. Singletary |
Degrees of Unsolvability in Formal Grammars. |
J. ACM |
1968 |
DBLP DOI BibTeX RDF |
|
52 | Philippe Codognet |
Equations, Disequations and Unsolvable Subsets (abstract). |
ISSAC |
1990 |
DBLP DOI BibTeX RDF |
|
52 | Peter H. Starke |
Decision Problems for Multi-Tape Automata. |
MFCS |
1976 |
DBLP DOI BibTeX RDF |
|
52 | Ann Yasuhara |
A Remark on Post Normal Systems. |
J. ACM |
1967 |
DBLP DOI BibTeX RDF |
|
48 | Qing Zhou |
Relatively Computable Functions of Real Variables. |
Computing |
2001 |
DBLP DOI BibTeX RDF |
Continuous real valued functions, degrees of unsolvability |
41 | Torkel Franzén |
What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem? |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
41 | Richard A. Shore |
Conjectures and questions from Gerald Sacks's Degrees of Unsolvability. |
Arch. Math. Log. |
1997 |
DBLP DOI BibTeX RDF |
|
41 | Timothy V. Griffiths |
The Unsolvability of the Equivalence Problem for Lambda-Free Nondeterministic Generalized Machines. |
J. ACM |
1968 |
DBLP DOI BibTeX RDF |
|
35 | Renato Bruni, Antonio Sassano |
Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances. |
CP |
2000 |
DBLP DOI BibTeX RDF |
|
31 | Marcin Mostowski, Konrad Zdanowski |
Degrees of logics with Henkin quantifiers in poor vocabularies. |
Arch. Math. Log. |
2004 |
DBLP DOI BibTeX RDF |
Henkin quantifiers, Degrees of unsolvability |
31 | David A. Basin |
An Environment For Automated Reasoning About Partial Functions. |
CADE |
1988 |
DBLP DOI BibTeX RDF |
Automated program development, unsolvability, theorem proving, computability, type theory, constructivity, tactics, partial functions |
24 | Mir Md Sajid Sarwar, Rajarshi Ray 0001, Ansuman Banerjee |
Explaining Unsolvability of Planning Problems in Hybrid Systems with Model Reconciliation. |
MEMOCODE |
2023 |
DBLP BibTeX RDF |
|
24 | Susumu Nishimura |
Proving Unsolvability of Set Agreement Task with Epistemic mu-Calculus. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Stefan Panjkovic, Andrea Micheli, Alessandro Cimatti |
Deciding Unsolvability in Temporal Planning under Action Non-Self-Overlapping. |
AAAI |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Remo Christen, Salomé Eriksson, Florian Pommerening, Malte Helmert |
Detecting Unsolvability Based on Separating Functions. |
ICAPS |
2022 |
DBLP BibTeX RDF |
|
24 | Sophie Bernard, Cyril Cohen, Assia Mahboubi, Pierre-Yves Strub |
Unsolvability of the Quintic Formalized in Dependent Type Theory. |
ITP |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Simon Ståhlberg, Guillem Francès, Jendrik Seipp |
Learning Generalized Unsolvability Heuristics for Classical Planning. |
IJCAI |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Salomé Eriksson, Malte Helmert |
Certified Unsolvability for SAT Planning with Property Directed Reachability. |
ICAPS |
2020 |
DBLP BibTeX RDF |
|
24 | Thomas Eiter, Zeynep G. Saribatur, Peter Schüller |
Abstraction for Zooming-In to Unsolvability Reasons of Grid-Cell Problems. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
24 | Sarath Sreedharan, Siddharth Srivastava, David E. Smith 0001, Subbarao Kambhampati |
Why Couldn't You do that? Explaining Unsolvability of Classical Planning Problems in the Presence of Plan Advice. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
24 | Sarath Sreedharan, Siddharth Srivastava 0001, David E. Smith 0001, Subbarao Kambhampati |
Why Can't You Do That HAL? Explaining Unsolvability of Planning Tasks. |
IJCAI |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Akihiro Kishimoto, Adi Botea, Radu Marinescu 0002 |
Depth-First Memory-Limited AND/OR Search and Unsolvability in Cyclic Search Spaces. |
IJCAI |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Salomé Eriksson, Gabriele Röger, Malte Helmert |
Inductive Certificates of Unsolvability for Domain-Independent Planning. |
IJCAI |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Olvi L. Mangasarian |
Sufficient conditions for the unsolvability and solvability of the absolute value equation. |
Optim. Lett. |
2017 |
DBLP DOI BibTeX RDF |
|
24 | Alla A. Shcheglova, A. D. Kononov |
Robust stability of differential-algebraic equations with an arbitrary unsolvability index. |
Autom. Remote. Control. |
2017 |
DBLP DOI BibTeX RDF |
|
24 | K. Vela Velupillai |
Algorithmic Economics: Incomputability, Undecidability and Unsolvability in Economics. |
The Incomputable |
2017 |
DBLP DOI BibTeX RDF |
|
24 | Leonardo Henrique Moreira, Célia Ghedini Ralha |
Improving Multi-agent Planning with Unsolvability and Independent Plan Detection. |
BRACIS |
2017 |
DBLP DOI BibTeX RDF |
|
24 | Salomé Eriksson, Gabriele Röger, Malte Helmert |
Unsolvability Certificates for Classical Planning. |
ICAPS |
2017 |
DBLP BibTeX RDF |
|
24 | Gabriele Röger |
Towards Certified Unsolvability in Classical Planning. |
IJCAI |
2017 |
DBLP DOI BibTeX RDF |
|
24 | Stephen G. Simpson |
Degrees of Unsolvability: A Tutorial. |
CiE |
2015 |
DBLP DOI BibTeX RDF |
|
24 | Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid |
A note on the unsolvability of the weighted region shortest path problem. |
Comput. Geom. |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Ulrike Brandt, Hermann K.-G. Walter |
Unsolvability Cores in Classification Problems. |
Log. Methods Comput. Sci. |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Klaus Ambos-Spies, Peter A. Fejer |
Degrees of Unsolvability. |
Computational Logic |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Jörg Hoffmann 0001, Peter Kissmann, Álvaro Torralba |
"Distance"? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability. |
ECAI |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid |
A Note on the Unsolvability of the Weighted Region Shortest Path Problem |
CoRR |
2013 |
DBLP BibTeX RDF |
|
24 | Ying-Fang Kao, V. Ragupathy, K. Vela Velupillai, Stefano Zambelli |
Noncomputability, unpredictability, undecidability, and unsolvability in economic and finance theories. |
Complex. |
2012 |
DBLP DOI BibTeX RDF |
|
24 | George Barmpalias |
Elementary differences between the degrees of unsolvability and degrees of compressibility. |
Ann. Pure Appl. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
24 | Liesbeth De Mol |
On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results |
CSP |
2008 |
DBLP BibTeX RDF |
|
24 | Mark Burgin |
Algorithmic complexity as a criterion of unsolvability. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
24 | María J. Cánovas, Marco A. López 0001, Juan Parra, F. Javier Toledo |
Distance to Solvability/Unsolvability in Linear Optimization. |
SIAM J. Optim. |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Wenxing Zhu |
Unsolvability of some optimization problems. |
Appl. Math. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Henning Bordihn, Markus Holzer 0001, Martin Kutrib |
Unsolvability levels of operation problems for subclasses of context-free languages. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Luciano Floridi |
On the Logical Unsolvability of the Gettier Problem. |
Synth. |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Joseph S. Miller |
Degrees of unsolvability of continuous functions. |
J. Symb. Log. |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Svyatoslav Sergeevich Lavrov |
On Algorithmic Unsolvability. |
Ershov Memorial Conference |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Onur Toker |
On the algorithmic unsolvability of some stability problems for hybrid systems. |
IEEE Trans. Autom. Control. |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Vann McGee |
On the Degrees of Unsolvability of Modal Predicate Logics of Provability. |
J. Symb. Log. |
1994 |
DBLP DOI BibTeX RDF |
|
24 | E. V. Krishnamurthy |
Unsolvability, complexity, and neural networks. |
Neural Networks |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Xizhong Zheng |
The rhombus classes of degrees of unsolvability (I), The jump properties. |
Arch. Math. Log. |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Lawrence S. Moss, José Meseguer 0001, Joseph A. Goguen |
Final Algebras, Cosemicomputable Algebras and Degrees of Unsolvability. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
24 | Martin Kummer |
Degrees of Unsolvability in Abstract Complexity Theory. |
Complexity Theory: Current Research |
1992 |
DBLP BibTeX RDF |
|
24 | Leonard M. Adleman, Manuel Blum 0001 |
Inductive Inference and Unsolvability. |
J. Symb. Log. |
1991 |
DBLP DOI BibTeX RDF |
|
24 | Irvin Roy Hentzel, David Pokrass Jacobs |
Complexity and Unsolvability Properties of Nilpotency. |
SIAM J. Comput. |
1990 |
DBLP DOI BibTeX RDF |
|
24 | Lawrence S. Moss, José Meseguer 0001, Joseph A. Goguen |
Final Algebras, Cosemicomputable Algebras, and Degrees of Unsolvability. |
Category Theory and Computer Science |
1987 |
DBLP DOI BibTeX RDF |
|
24 | Hajime Sawamura, Taku Takeshima |
Recursive Unsolvability of Determinacy, Solvable Cases of Determinancy and their Applications to Prolog Optimization. |
SLP |
1985 |
DBLP BibTeX RDF |
|
24 | Warren D. Goldfarb |
The Unsolvability of the Godel Class with Identity. |
J. Symb. Log. |
1984 |
DBLP DOI BibTeX RDF |
|
24 | Robert S. Boyer, J Strother Moore |
A Mechanical Proof of the Unsolvability of the Halting Problem. |
J. ACM |
1984 |
DBLP DOI BibTeX RDF |
|
24 | Michael Stob |
Index Sets and Degrees of Unsolvability. |
J. Symb. Log. |
1982 |
DBLP DOI BibTeX RDF |
|
24 | Robert P. Daley |
Busy Beaver Sets and the Degrees of Unsolvability. |
J. Symb. Log. |
1981 |
DBLP DOI BibTeX RDF |
|
24 | Joanna Jedrzejowicz |
Undecidable Problems Associated with Combinatiorial Systems and Their One-One Degrees of Unsolvability. |
Math. Log. Q. |
1981 |
DBLP DOI BibTeX RDF |
|
24 | Jan Grabowski |
The Unsolvability of Some Petri Net Language Problems. |
Inf. Process. Lett. |
1979 |
DBLP DOI BibTeX RDF |
|
24 | Forbes D. Lewis |
On unsolvability in subrecursive classes of predicates. |
Notre Dame J. Formal Log. |
1979 |
DBLP DOI BibTeX RDF |
|
24 | Robert P. Daley |
On the Simplification of Constructions in Degrees of Unsolvability via Computational Complexity. |
MFCS |
1979 |
DBLP DOI BibTeX RDF |
|
24 | Oscar H. Ibarra |
The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications. |
SIAM J. Comput. |
1978 |
DBLP DOI BibTeX RDF |
|
24 | Thomas G. McLaughlin |
Degrees of unsolvability and strong forms of ΛR + ΛR ⊈ ΛR. |
Notre Dame J. Formal Log. |
1977 |
DBLP DOI BibTeX RDF |
|
24 | Oscar H. Ibarra |
The Unsolvability of the Equivalence Problem for epsilon-free NGSM's with Unary Input (Output) Alphabet and Applications |
FOCS |
1977 |
DBLP DOI BibTeX RDF |
|
24 | Charles E. Hughes |
Two Variable Implicational Calculi of Prescribed Many-One Degrees of Unsolvability. |
J. Symb. Log. |
1976 |
DBLP DOI BibTeX RDF |
|
24 | Alistair H. Lachlan, R. Lebeuf |
Countable Initial Segments of the Degrees of Unsolvability. |
J. Symb. Log. |
1976 |
DBLP DOI BibTeX RDF |
|
24 | Ivan Marques |
On Degrees of Unsolvability and Complexity Properties. |
J. Symb. Log. |
1975 |
DBLP DOI BibTeX RDF |
|
24 | Carl G. Jockusch Jr. |
An Application of sigma04 Determinancy to the Degrees of Unsolvability. |
J. Symb. Log. |
1973 |
DBLP DOI BibTeX RDF |
|
24 | Meera Blattner |
The Unsolvability of the Equality Problem for Sentential Forms of Context-Free Grammars. |
J. Comput. Syst. Sci. |
1973 |
DBLP DOI BibTeX RDF |
|
24 | Charles E. Hughes |
Degrees of unsolvability associated with Markov algorithms. |
Int. J. Parallel Program. |
1972 |
DBLP DOI BibTeX RDF |
|
24 | Dorothy Bollman, M. Tapia |
On the recursive unsolvability of the provability of the deduction theorem in partial propositional calculi. |
Notre Dame J. Formal Log. |
1972 |
DBLP DOI BibTeX RDF |
|
24 | Joseph R. Shoenfield |
Degrees of unsolvability. |
|
1971 |
RDF |
|
24 | C. E. M. Yates |
Initial Segments of the Degrees of Unsolvability Part II: Minimal Degrees. |
J. Symb. Log. |
1970 |
DBLP DOI BibTeX RDF |
|
24 | Forbes D. Lewis |
Unsolvability Considerations in Computational Complexity |
STOC |
1970 |
DBLP DOI BibTeX RDF |
|
24 | Forbes D. Lewis |
Unsolvability Considerations in Computational Complexity. |
|
1970 |
RDF |
|
24 | Manuel Lerman |
Some Nondistributive Lattices as Initial Segments of the Degrees of Unsolvability. |
J. Symb. Log. |
1969 |
DBLP DOI BibTeX RDF |
|
24 | Gabor T. Herman |
The Unsolvability of the Uniform Halting Problem for Two State Turing Machines. |
J. Symb. Log. |
1969 |
DBLP DOI BibTeX RDF |
|
24 | Robert A. Di Paola |
The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas. |
J. ACM |
1969 |
DBLP DOI BibTeX RDF |
|
24 | George Boolos, Hilary Putnam |
Degrees of Unsolvability of Constructible Sets of Integers. |
J. Symb. Log. |
1968 |
DBLP DOI BibTeX RDF |
|
24 | Sheila A. Greibach |
The Unsolvability of the Recognition of Linear Context-Free Languages. |
J. ACM |
1966 |
DBLP DOI BibTeX RDF |
|
24 | Gustav Hensel, Hilary Putnam |
On the Notational Independence of Various Hierarchies of Degrees of Unsolvability. |
J. Symb. Log. |
1965 |
DBLP DOI BibTeX RDF |
|
24 | Ann H. Ihrig |
The Post-Lineal theorems for arbitrary recursively enumerable degrees of unsolvability. |
Notre Dame J. Formal Log. |
1965 |
DBLP DOI BibTeX RDF |
|
24 | Martin D. Davis |
Computability and Unsolvability. |
|
1958 |
RDF |
|
24 | Solomon Feferman |
Degrees of Unsolvability Associated with Classes of Formalized Theories. |
J. Symb. Log. |
1957 |
DBLP DOI BibTeX RDF |
|
24 | Richard Friedberg |
A Criterion for Completeness of Degrees of Unsolvability. |
J. Symb. Log. |
1957 |
DBLP DOI BibTeX RDF |
|
24 | Emil L. Post |
Recursive Unsolvability of a Problem of Thue. |
J. Symb. Log. |
1947 |
DBLP DOI BibTeX RDF |
|
17 | Damien Imbs, Michel Raynal |
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation. |
SSS |
2009 |
DBLP DOI BibTeX RDF |
t-Resilience, Wait-free environment, Fault-Tolerance, Distributed computability, Shared memory system, Reduction, Arbiter, Asynchronous processes, Process crash failure |
17 | Jirí Matousek 0001, Martin Tancer, Uli Wagner 0001 |
Hardness of embedding simplicial complexes in Rd. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Sanjai Narain, Gary Levin, Sharad Malik, Vikram Kaul |
Declarative Infrastructure Configuration Synthesis and Debugging. |
J. Netw. Syst. Manag. |
2008 |
DBLP DOI BibTeX RDF |
Requirement solver, Model finder, Diagnosis, Partial evaluation, SAT solver, Troubleshooting |
17 | Giancarlo Mauri, Mario J. Pérez-Jiménez, Claudio Zandron |
On a Paun's Conjecture in Membrane Systems. |
IWINAC (1) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Rafael M. Gasca, Carmelo Del Valle, María Teresa Gómez-López, Rafael Ceballos |
NMUS: Structural Analysis for Improving the Derivation of All MUSes in Overconstrained Numeric CSPs. |
CAEPIA |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Hermann Gruber, Markus Holzer 0001, Martin Kutrib |
More on the Size of Higman-Haines Sets: Effective Constructions. |
MCU |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Colette Johnen, Lisa Higham |
Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks. |
DISC |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Gilles Dequen, Olivier Dubois 0002 |
An Efficient Approach to Solving Random k-satProblems. |
J. Autom. Reason. |
2006 |
DBLP DOI BibTeX RDF |
solving, heuristic, satisfiability |
17 | Yohji Akama, Thomas Zeugmann |
Consistency Conditions for Inductive Inference of Recursive Functions. |
JSAI |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Martin Davis |
The Church-Turing Thesis: Consensus and Opposition. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Marco Antonio Montes de Oca, Leonardo Garrido, José-Luis Aguirre |
Effects of Inter-agent Communication in Ant-Based Clustering Algorithms: A Case Study on Communication Policies in Swarm Systems. |
MICAI |
2005 |
DBLP DOI BibTeX RDF |
|