☰

Anil Nerode - Publications

Affiliations: 
Cornell University, Ithaca, NY, United States 
Area:
Mathematics
Tree Info Similar researchers PubMed Report error

40 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Artemov S, Nerode A. Special Issue on Logical Foundations of Computer Science Journal of Logic and Computation. 30: 1-1. DOI: 10.1093/Logcom/Exaa026  0.318
2008 Nerode A, Remmel JB. Consistency properties and set based logic programming Annals of Mathematics and Artificial Intelligence. 53: 289-311. DOI: 10.1007/S10472-009-9117-X  0.434
2005 Wijesekera D, Nerode A. Tableaux for constructive concurrent dynamic logic Annals of Pure and Applied Logic. 135: 1-72. DOI: 10.1016/J.Apal.2004.12.001  0.427
2004 Ganguli S, Nerode A. Effective completeness theorems for modal logic Annals of Pure and Applied Logic. 128: 141-195. DOI: 10.1016/J.Apal.2003.12.001  0.599
2004 Davoren JM, Moor T, Goré RP, Coulthard V, Nerode A. On two-sided approximate model-checking: problem formulation and solution via finite topologies Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3253: 52-67. DOI: 10.1007/978-3-540-30206-3_6  0.353
2001 Wijesekera D, Ganesh M, Srivastava J, Nerode A. Normal forms and syntactic completeness proofs for functional independencies Theoretical Computer Science. 266: 365-405. DOI: 10.1016/S0304-3975(00)00195-X  0.337
1999 Marek VW, Nerode A, Remmel JB. Logic programs, well-orderings, and forward chaining Annals of Pure and Applied Logic. 96: 231-276. DOI: 10.1016/S0168-0072(98)00041-4  0.377
1998 Ishihara H, Khoussainov B, Nerode A. Decidable Kripke models of intuitionistic theories Annals of Pure and Applied Logic. 93: 115-123. DOI: 10.1016/S0168-0072(97)00057-2  0.378
1998 Ishihara H, Khoussainov B, Nerode A. Computable Kripke Models and Intermediate Logics Information and Computation. 143: 205-230. DOI: 10.1006/Inco.1998.2704  0.421
1997 Marek VW, Nerode A, Remmel JB. Complexity of recursive normal default logic Fundamenta Informaticae. 32: 139-147. DOI: 10.3233/Fi-1997-32203  0.394
1997 Nerode A, Remmel J, Subrahmanian V. Annotated nonmonotonic rule systems Theoretical Computer Science. 171: 111-146. DOI: 10.1016/S0304-3975(96)00127-2  0.392
1997 Wiktor Marek V, Nerode A, Remmel JB. Nonmonotonic rule systems with recursive sets of restraints Archive For Mathematical Logic. 36: 339-384. DOI: 10.1007/S001530050070  0.355
1997 Nerode A, Remmel JB, Yakhnis A. Hybrid system games: Extraction of control automata with small topologies Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1273: 248-293. DOI: 10.1007/Bfb0031565  0.348
1996 Bell C, Nerode A, Ng RT, Subrahmanian VS. Implementing deductive databases by mixed integer programming Acm Transactions On Database Systems. 21: 238-269. DOI: 10.1145/232616.232691  0.358
1996 Lu JJ, Nerode A, Subrahmanian VS. Hybrid knowledge bases Ieee Transactions On Knowledge and Data Engineering. 8: 773-785. DOI: 10.1109/69.542029  0.421
1996 Kohn W, Nerode A, James J, Remmel J, Cummings B. A New Approach to Generating Finite-State Control Programs for Hybrid Systems Ifac Proceedings Volumes. 29: 4884-4889. DOI: 10.1016/S1474-6670(17)58454-2  0.325
1996 Gottlob G, Marcus S, Nerode A, Salzer G, Subrahmanian V. A non-ground realization of the stable and well-founded semantics Theoretical Computer Science. 166: 221-262. DOI: 10.1016/0304-3975(95)00207-3  0.396
1996 Kagan V, Nerode A, Subrahmanian VS. Computing minimal models by partial instantiation Theoretical Computer Science. 155: 157-177. DOI: 10.1016/0304-3975(94)00216-9  0.388
1996 Ge X, Nerode A. Effective content of the calculus of variations I: Semi-continuity and the chattering lemma Annals of Pure and Applied Logic. 78: 127-146. DOI: 10.1016/0168-0072(95)00034-8  0.336
1996 Nerode A, Remmel JB, Yakhnis A. McNaughton games and extracting strategies for concurrent programs Annals of Pure and Applied Logic. 78: 203-242. DOI: 10.1016/0168-0072(95)00032-1  0.307
1995 Kohn W, James J, Nerode A, Harbison K, Agrawala A. A hybrid systems approach to computer-aided control engineering Ieee Control Systems Magazine. 15: 14-25. DOI: 10.1109/37.375279  0.31
1995 Kohn W, Nerode A, Remmel JB, Yakhnis A. Viability in hybrid systems Theoretical Computer Science. 138: 141-168. DOI: 10.1016/0304-3975(94)00150-H  0.307
1995 Nerode A, Ng RT, Subrahmanian VS. Computing Circumscriptive Databases. I. Theory and Algorithms Information and Computation. 116: 58-80. DOI: 10.1006/Inco.1995.1005  0.349
1995 Wiktor Marek V, Nerode A, Remmel JB. On logical constraints in logic programming Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 928: 43-56.  0.305
1994 Bell C, Nerode A, Ng RT, Subrahmanian VS. Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases Journal of the Acm (Jacm). 41: 1178-1215. DOI: 10.1145/195613.195637  0.39
1994 Marek VW, Nerode A, Remmel JB. The Stable Models of a Predicate Logic Program Journal of Logic Programming. 21: 129-154. DOI: 10.1016/S0743-1066(14)80008-3  0.365
1994 Marek VW, Nerode A, Remmel JB. A context for belief revision: forward chaining-normal nonmonotomic rule systems Annals of Pure and Applied Logic. 67: 269-323. DOI: 10.1016/0168-0072(94)90013-2  0.462
1994 Kagan V, Nerode A, Subrahmanian VS. Computing definite logic programs by partial instantiation Annals of Pure and Applied Logic. 67: 161-182. DOI: 10.1016/0168-0072(94)90010-8  0.387
1994 Artemov SN, Nerode A. Logical Foundations of Computer Science Lecture Notes in Computer Science. 5407. DOI: 10.1007/978-3-540-92687-0  0.314
1993 Nerode A, Taitslin M. Logic at Tver'92 Journal of Symbolic Logic. 58: 1150-1150. DOI: 10.1017/S0022481200021204  0.343
1992 Marek W, Nerode A, Remmel J. How complicated is the set of stable models of a recursive logic program? Annals of Pure and Applied Logic. 56: 119-135. DOI: 10.1016/0168-0072(92)90069-C  0.427
1992 Marek W, Nerode A, Remmel J. A theory of nonmonotonic rule systems II Annals of Mathematics and Artificial Intelligence. 5: 229-263. DOI: 10.1007/BF01543477  0.334
1985 Nerode A, Harrington LA. The Work of Harvey Friedman1) Studies in Logic and the Foundations of Mathematics. 117: 1-10. DOI: 10.1016/S0049-237X(09)70154-5  0.409
1983 Nerode A, Remmel JB. Recursion Theory on Matroids II Studies in Logic and the Foundations of Mathematics. 111: 133-184. DOI: 10.1016/S0049-237X(08)70960-1  0.395
1982 Metakides G, Nerode A. The introduction of non-recursive methods into mathematics Studies in Logic and the Foundations of Mathematics. 110: 319-335. DOI: 10.1016/S0049-237X(09)70135-1  0.359
1980 Nerode A, Shore RA. Second order logic and first order theories of reducibility orderings* Studies in Logic and the Foundations of Mathematics. 101: 181-200. DOI: 10.1016/S0049-237X(08)71260-6  0.362
1980 Nerode A, Shore RA. Reducibility orderings: Theories, definability and automorphisms Annals of Mathematical Logic. 18: 61-89. DOI: 10.1016/0003-4843(80)90004-2  0.35
1973 Nerode A, Barwise KJ. Meeting of the Association for Symbolic Logic, New York 1969 Journal of Symbolic Logic. 38: 348-358. DOI: 10.2307/2272113  0.304
1970 Nerode A, Manaster AB. A universal embedding property of the RETs Journal of Symbolic Logic. 35: 51-59. DOI: 10.1017/S0022481200092227  0.375
1966 Nerode A. Diophantine correct non-standard models in the isols Annals of Mathematics. 84: 421. DOI: 10.2307/1970455  0.338
Show low-probability matches.