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