Matthew L. Ginsberg

	2011
72		Jim Apple, Paul Chang, Aran Clauson, Heidi E. Dixon, Hiba Fakhoury, Matthew L. Ginsberg, Erin Keenan, Alex Leighton, Kevin Scavezze, Bryan Smith: Green Driver: AI in a Microcosm. AAAI 2011
71		Matthew L. Ginsberg: GIB: Imperfect Information in a Computationally Challenging Game CoRR abs/1106.0669: (2011)
70		Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes: Generalizing Boolean Satisfiability I: Background and Survey of Existing Work CoRR abs/1107.0040: (2011)
69		Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes: Generalizing Boolean Satisfiability II: Theory CoRR abs/1109.2134: (2011)
68		Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes: Generalizing Boolean Satisfiability III: Implementation CoRR abs/1109.2142: (2011)
67		Matthew L. Ginsberg: Dr.Fill: Crosswords and an Implemented Solver for Singly Weighted CSPs. J. Artif. Intell. Res. (JAIR) 42: 851-886 (2011)
	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		Matthew L. Ginsberg: Of Mousetraps and Men: A Cautionary Tale. CP 2007: 2
	2006
64		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		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		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		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		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		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		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		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

Coauthor Index

1	Jim Apple	[72]
2	Andrew B. Baker	[21] [22]
3	Paul Chang	[72]
4	Aran Clauson	[72]
5	James M. Crawford	[53]
6	Oliver Dain	[64]
7	Adnan Darwiche	[37]
8	Rina Dechter	[49]
9	Heidi E. Dixon	[59] [60] [61] [62] [63] [68] [69] [70] [72]
10	David W. Etherington	[20]
11	Hiba Fakhoury	[72]
12	Kenneth D. Forbus	[20]
13	Michael Frank	[27]
14	Eugene C. Freuder	[49]
15	Donald F. Geddis	[34]
16	Michael R. Genesereth	[2] [6] [8]
17	Michael P. Halpin	[27]
18	William D. Harvey	[26] [36] [48]
19	David K. Hofer	[62] [63] [68]
20	Hugh W. Holbrook	[41]
21	David J. Israel	[20]
22	Ari K. Jónsson	[52]
23	Erin Keenan	[64] [72]
24	Johan de Kleer	[23]
25	Alex Leighton	[72]
26	Vladimir Lifschitz	[20]
27	Eugene M. Luks	[53] [60] [62] [63] [68] [69]
28	David A. McAllester	[42] [43]
29	Iain Pardoe	[64]
30	Andrew J. Parkes	[55] [57] [60] [61] [62] [63] [68] [69] [70]
31	John M. Pyle	[64]
32	Katrina Ray	[66]
33	Michael Reinfrank	[23]
34	Jeffrey S. Rosenschein	[8]
35	Amitabha Roy	[53] [55]
36	Erik Sandewall	[23]
37	Kevin Scavezze	[72]
38	Bart Selman	[49]
39	Bryan Smith	[72]
40	David E. Smith	[6] [10] [13] [14]
41	Tristan B. Smith	[64]
42	Andrew Stoneman	[64]
43	Mark C. Torrance	[27]
44	Edward P. K. Tsang	[49]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page