The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Matthew L. Ginsberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Matthew L. Ginsberg
    Multi-Valued Logics. [Citation Graph (3, 0)][DBLP]
    AAAI, 1986, pp:243-249 [Conf]
  2. Matthew L. Ginsberg
    Counterfactuals. [Citation Graph (3, 0)][DBLP]
    Artif. Intell., 1986, v:30, n:1, pp:35-79 [Journal]
  3. Matthew L. Ginsberg
    A Circumscriptive Theorem Prover. [Citation Graph (2, 0)][DBLP]
    Artif. Intell., 1989, v:39, n:2, pp:209-230 [Journal]
  4. David E. Smith, Michael R. Genesereth, Matthew L. Ginsberg
    Controlling Recursive Inference. [Citation Graph (2, 0)][DBLP]
    Artif. Intell., 1986, v:30, n:3, pp:343-389 [Journal]
  5. Michael R. Genesereth, Matthew L. Ginsberg
    Logic Programming. [Citation Graph (2, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:9, pp:933-941 [Journal]
  6. Matthew L. Ginsberg
    Non-Monotonic Reasoning Using Dempster's Rule. [Citation Graph (1, 0)][DBLP]
    AAAI, 1984, pp:126-129 [Conf]
  7. Matthew L. Ginsberg, David E. Smith
    Reasoning About Action I: A Possible Worlds Approach. [Citation Graph (1, 0)][DBLP]
    Artif. Intell., 1988, v:35, n:2, pp:165-195 [Journal]
  8. Matthew L. Ginsberg
    Universal Planning: An (Almost) Universally Bad Idea. [Citation Graph (1, 0)][DBLP]
    AI Magazine, 1989, v:10, n:4, pp:40-44 [Journal]
  9. Matthew L. Ginsberg
    Ginsberg Replies of Chapman and Schoppers - Universal Planning Research: A Good or Bad Idea? [Citation Graph (1, 0)][DBLP]
    AI Magazine, 1989, v:10, n:4, pp:61-62 [Journal]
  10. Matthew L. Ginsberg
    Dynamic Backtracking. [Citation Graph (1, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 1993, v:1, n:, pp:25-46 [Journal]
  11. Adnan Darwiche, Matthew L. Ginsberg
    A Symbolic Generalization of Probability Theory. [Citation Graph (0, 0)][DBLP]
    AAAI, 1992, pp:622-627 [Conf]
  12. Heidi E. Dixon, Matthew L. Ginsberg
    Inference Methods for a Pseudo-Boolean Satisfiability Solver. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2002, pp:635-640 [Conf]
  13. Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes
    Implementing a Generalized Version of Resolution. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:55-60 [Conf]
  14. Michael R. Genesereth, Matthew L. Ginsberg, Jeffrey S. Rosenschein
    Cooperation without Communication. [Citation Graph (0, 0)][DBLP]
    AAAI, 1986, pp:51-57 [Conf]
  15. Matthew L. Ginsberg
    A Circumscriptive Theorem Prover. [Citation Graph (0, 0)][DBLP]
    AAAI, 1988, pp:470-474 [Conf]
  16. Matthew L. Ginsberg
    Partition Search. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 1, 1996, pp:228-233 [Conf]
  17. Matthew L. Ginsberg, Michael Frank, Michael P. Halpin, Mark C. Torrance
    Search Lessons Learned from Crossword Puzzles. [Citation Graph (0, 0)][DBLP]
    AAAI, 1990, pp:210-215 [Conf]
  18. Matthew L. Ginsberg, Donald F. Geddis
    Is There any Need for Domain-Dependent Control Information? [Citation Graph (0, 0)][DBLP]
    AAAI, 1991, pp:452-457 [Conf]
  19. Matthew L. Ginsberg, William D. Harvey
    Iterative Broadening. [Citation Graph (0, 0)][DBLP]
    AAAI, 1990, pp:216-220 [Conf]
  20. Matthew L. Ginsberg, Andrew J. Parkes, Amitabha Roy
    Supermodels and Robustness. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:334-339 [Conf]
  21. Matthew L. Ginsberg, David E. Smith
    Possible Worlds and the Qualification Problem. [Citation Graph (0, 0)][DBLP]
    AAAI, 1987, pp:212-217 [Conf]
  22. Matthew L. Ginsberg
    Approximate Planning (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    AIPS, 1994, pp:68-73 [Conf]
  23. Andrew B. Baker, Matthew L. Ginsberg
    A Theorem Prover for Prioritized Circumscription. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1989, pp:463-467 [Conf]
  24. Andrew B. Baker, Matthew L. Ginsberg
    Temporal Projection and Explanation. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1989, pp:906-911 [Conf]
  25. Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang
    Systematic Versus Stochastic Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:2027-2032 [Conf]
  26. Matthew L. Ginsberg
    Counterfactuals. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1985, pp:80-86 [Conf]
  27. Matthew L. Ginsberg
    Does Probability Have a Place in Non-monotonic Reasoning? [Citation Graph (0, 0)][DBLP]
    IJCAI, 1985, pp:107-110 [Conf]
  28. Matthew L. Ginsberg
    GIB: Steps Toward an Expert-Level Bridge-Playing Program. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:584-593 [Conf]
  29. William D. Harvey, Matthew L. Ginsberg
    Limited Discrepancy Search. [Citation Graph (0, 0)][DBLP]
    IJCAI (1), 1995, pp:607-615 [Conf]
  30. James M. Crawford, Matthew L. Ginsberg, Eugene M. Luks, Amitabha Roy
    Symmetry-Breaking Predicates for Search Problems. [Citation Graph (0, 0)][DBLP]
    KR, 1996, pp:148-159 [Conf]
  31. David W. Etherington, Kenneth D. Forbus, Matthew L. Ginsberg, David J. Israel, Vladimir Lifschitz
    Critical Issues in Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    KR, 1989, pp:500-504 [Conf]
  32. Matthew L. Ginsberg
    Computational Considerations in Reasoning about Action. [Citation Graph (0, 0)][DBLP]
    KR, 1991, pp:250-261 [Conf]
  33. Matthew L. Ginsberg
    The Computational Value of Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    KR, 1991, pp:262-268 [Conf]
  34. Matthew L. Ginsberg
    A New Algorithm for Generative Planning. [Citation Graph (0, 0)][DBLP]
    KR, 1996, pp:186-197 [Conf]
  35. Matthew L. Ginsberg
    Do Computers Need Common Sense? [Citation Graph (0, 0)][DBLP]
    KR, 1996, pp:620-626 [Conf]
  36. Matthew L. Ginsberg, David A. McAllester
    GSAT and Dynamic Backtracking. [Citation Graph (0, 0)][DBLP]
    KR, 1994, pp:226-237 [Conf]
  37. Matthew L. Ginsberg, Andrew J. Parkes
    Satisfiability Algorithms and Finite Quantification. [Citation Graph (0, 0)][DBLP]
    KR, 2000, pp:690-701 [Conf]
  38. Ari K. Jónsson, Matthew L. Ginsberg
    Procedural Reasoning in Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    KR, 1996, pp:160-171 [Conf]
  39. Matthew L. Ginsberg
    A Circumscriptive Theorem Prover. [Citation Graph (0, 0)][DBLP]
    NMR, 1988, pp:100-114 [Conf]
  40. Matthew L. Ginsberg, David A. McAllester
    GSAT and Dynamic Backtracking. [Citation Graph (0, 0)][DBLP]
    PPCP, 1994, pp:243-265 [Conf]
  41. Matthew L. Ginsberg
    Bilattices and Modal Operators. [Citation Graph (0, 0)][DBLP]
    TARK, 1990, pp:273-287 [Conf]
  42. Matthew L. Ginsberg
    Implementing Probabilistic Reasoning. [Citation Graph (0, 0)][DBLP]
    UAI, 1985, pp:331-338 [Conf]
  43. Oliver Dain, Matthew L. Ginsberg, Erin Keenan, John M. Pyle, Tristan B. Smith, Andrew Stoneman, Iain Pardoe
    Stochastic shipyard simulation with SimYard. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 2006, pp:1770-1778 [Conf]
  44. Matthew L. Ginsberg
    Marvin Minsky, The Society of Mind. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1991, v:48, n:3, pp:335-339 [Journal]
  45. Matthew L. Ginsberg
    Approximate Planning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1995, v:76, n:1-2, pp:89-123 [Journal]
  46. Matthew L. Ginsberg, William D. Harvey
    Iterative Broadening. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1992, v:55, n:2, pp:367-383 [Journal]
  47. Matthew L. Ginsberg, David E. Smith
    Reasoning About Action II: The Qualification Problem. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1988, v:35, n:3, pp:311-342 [Journal]
  48. Matthew L. Ginsberg
    Knowledge Interchange Format: the KIF of Death. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 1991, v:12, n:3, pp:57-63 [Journal]
  49. Matthew L. Ginsberg
    Reply to Cheeseman's An inquiry into computer understanding. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1988, v:4, n:, pp:77-78 [Journal]
  50. Matthew L. Ginsberg
    Multivalued logics: a uniform approach to reasoning in artificial intelligence. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1988, v:4, n:, pp:265-316 [Journal]
  51. Matthew L. Ginsberg
    Prolegomena to Any Future Prolegomena. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1992, v:8, n:, pp:253-256 [Journal]
  52. Matthew L. Ginsberg
    Dynamic Backtracking [Citation Graph (0, 0)][DBLP]
    CoRR, 1993, v:0, n:, pp:- [Journal]
  53. Matthew L. Ginsberg
    Epistemological and Heuristic Adequacy Revisited. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1995, v:27, n:3, pp:331-333 [Journal]
  54. Matthew L. Ginsberg, Hugh W. Holbrook
    What Defaults can do that Hierarchies Can't. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1994, v:21, n:1/2, pp:149-159 [Journal]
  55. Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes
    Generalizing Boolean Satisfiability II: Theory. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2004, v:22, n:, pp:481-534 [Journal]
  56. Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes
    Generalizing Boolean Satisfiability I: Background and Survey of Existing Work. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2004, v:21, n:, pp:193-243 [Journal]
  57. Matthew L. Ginsberg
    GIB: Imperfect Information in a Computationally Challenging Game. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2001, v:14, n:, pp:303-358 [Journal]
  58. Matthew L. Ginsberg
    Modality and Interrupts. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1995, v:14, n:1, pp:43-91 [Journal]
  59. Matthew L. Ginsberg
    Negative Subgoals with Free Variables. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1991, v:11, n:3&4, pp:271-293 [Journal]
  60. Matthew L. Ginsberg
    Bilattices and Modal Operators. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1990, v:1, n:1, pp:41-69 [Journal]
  61. Matthew L. Ginsberg
    The MVL Theorem Proving System. [Citation Graph (0, 0)][DBLP]
    SIGART Bulletin, 1991, v:2, n:3, pp:57-60 [Journal]
  62. Matthew L. Ginsberg
    Of Mousetraps and Men: A Cautionary Tale. [Citation Graph (0, 0)][DBLP]
    CP, 2007, pp:2- [Conf]
  63. Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes
    Generalizing Boolean Satisfiability III: Implementation. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2005, v:23, n:, pp:441-531 [Journal]

  64. The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions. [Citation Graph (, )][DBLP]


Search in 0.036secs, Finished in 0.038secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002