Matthew L. Ginsberg

Publication Activity (10 Years)

Years Active: 1984-2022
Publications (10 Years): 1

Top Topics

Probabilistic Reasoning

Arc Consistency

Constraint Solver

Series Parallel

Top Venues

J. Artif. Intell. Res.

Publications

Matthew L. Ginsberg
Unbalancing Binary Trees. CoRR (2022)
Matthew L. Ginsberg
Satsisfiability and Systematicity. J. Artif. Intell. Res. 53 (2015)
Matthew L. Ginsberg
Dr.Fill: Crosswords and an Implemented Solver for Singly Weighted CSPs. CoRR (2014)
Matthew L. Ginsberg
Implementing Probabilistic Reasoning CoRR (2013)
Matthew L. Ginsberg
The Crossword Solver DR.FILL. J. Int. Comput. Games Assoc. 35 (2) (2012)
Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes
Generalizing Boolean Satisfiability III: Implementation CoRR (2011)
Matthew L. Ginsberg
GIB: Imperfect Information in a Computationally Challenging Game CoRR (2011)
Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes
Generalizing Boolean Satisfiability II: Theory CoRR (2011)
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)
Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work CoRR (2011)
Matthew L. Ginsberg
Dr.Fill: Crosswords and an Implemented Solver for Singly Weighted CSPs. J. Artif. Intell. Res. 42 (2011)
Katrina Ray, Matthew L. Ginsberg
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions. ICAPS (2008)
Matthew L. Ginsberg
Of Mousetraps and Men: A Cautionary Tale. CP (2007)
Oliver Dain, Matthew L. Ginsberg, Erin Keenan, John M. Pyle, Tristan B. Smith, Andrew Stoneman, Iain Pardoe
Stochastic shipyard simulation with SimYard. WSC (2006)
Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes
Generalizing Boolean Satisfiability III: Implementation. J. Artif. Intell. Res. 23 (2005)
Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes
Implementing a Generalized Version of Resolution. AAAI (2004)
Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work. J. Artif. Intell. Res. 21 (2004)
Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes
Generalizing Boolean Satisfiability II: Theory. J. Artif. Intell. Res. 22 (2004)
Heidi E. Dixon, Matthew L. Ginsberg
Inference Methods for a Pseudo-Boolean Satisfiability Solver. AAAI/IAAI (2002)
Matthew L. Ginsberg
GIB: Imperfect Information in a Computationally Challenging Game. J. Artif. Intell. Res. 14 (2001)
Matthew L. Ginsberg, Andrew J. Parkes
Satisfiability Algorithms and Finite Quantification. KR (2000)
Matthew L. Ginsberg
Report on the 1999 World Computer-Bridge Championship. J. Int. Comput. Games Assoc. 23 (2) (2000)
Matthew L. Ginsberg
GIB: Steps Toward an Expert-Level Bridge-Playing Program. IJCAI (1999)
Matthew L. Ginsberg, Andrew J. Parkes, Amitabha Roy
Supermodels and Robustness. AAAI/IAAI (1998)
Matthew L. Ginsberg
A New Algorithm for Generative Planning. KR (1996)
Ari K. Jónsson, Matthew L. Ginsberg
Procedural Reasoning in Constraint Satisfaction. KR (1996)
James M. Crawford, Matthew L. Ginsberg, Eugene M. Luks, Amitabha Roy
Symmetry-Breaking Predicates for Search Problems. KR (1996)
Matthew L. Ginsberg
Partition Search. AAAI/IAAI, Vol. 1 (1996)
Matthew L. Ginsberg
Do Computers Need Common Sense? KR (1996)
Matthew L. Ginsberg
Approximate Planning. Artif. Intell. 76 (1-2) (1995)
Matthew L. Ginsberg
Epistemological and Heuristic Adequacy Revisited. ACM Comput. Surv. 27 (3) (1995)
William D. Harvey, Matthew L. Ginsberg
Limited Discrepancy Search. IJCAI (1) (1995)
Matthew L. Ginsberg
Modality and Interrupts. J. Autom. Reason. 14 (1) (1995)
Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang
Systematic Versus Stochastic Constraint Satisfaction. IJCAI (1995)
Matthew L. Ginsberg
Approximate Planning (Extended Abstract). AIPS (1994)
Matthew L. Ginsberg, David A. McAllester
GSAT and Dynamic Backtracking. KR (1994)
Matthew L. Ginsberg, David A. McAllester
GSAT and Dynamic Backtracking. PPCP (1994)
Matthew L. Ginsberg, Hugh W. Holbrook
What Defaults can do that Hierarchies Can't. Fundam. Informaticae 21 (1/2) (1994)
Matthew L. Ginsberg
Dynamic Backtracking CoRR (1993)
Matthew L. Ginsberg
Dynamic Backtracking. J. Artif. Intell. Res. 1 (1993)
Matthew L. Ginsberg
Prolegomena to Any Future Prolegomena. Comput. Intell. 8 (1992)
Adnan Darwiche, Matthew L. Ginsberg
A Symbolic Generalization of Probability Theory. AAAI (1992)
Matthew L. Ginsberg, William D. Harvey
Iterative Broadening. Artif. Intell. 55 (2) (1992)
Matthew L. Ginsberg
Marvin Minsky, The Society of Mind. Artif. Intell. 48 (3) (1991)
Matthew L. Ginsberg
Negative Subgoals with Free Variables. J. Log. Program. 11 (3&4) (1991)
Matthew L. Ginsberg
The Computational Value of Nonmonotonic Reasoning. KR (1991)
Matthew L. Ginsberg
The MVL Theorem Proving System. SIGART Bull. 2 (3) (1991)
Matthew L. Ginsberg
Computational Considerations in Reasoning about Action. KR (1991)
Matthew L. Ginsberg, Donald F. Geddis
Is There any Need for Domain-Dependent Control Information? AAAI (1991)
Matthew L. Ginsberg
Knowledge Interchange Format: the KIF of Death. AI Mag. 12 (3) (1991)
Matthew L. Ginsberg, William D. Harvey
Iterative Broadening. AAAI (1990)
Matthew L. Ginsberg
Bilattices and Modal Operators. TARK (1990)
Matthew L. Ginsberg, Michael Frank, Michael P. Halpin, Mark C. Torrance
Search Lessons Learned from Crossword Puzzles. AAAI (1990)
Matthew L. Ginsberg
Bilattices and Modal Operators. J. Log. Comput. 1 (1) (1990)
Matthew L. Ginsberg
Universal Planning: An (Almost) Universally Bad Idea. AI Mag. 10 (4) (1989)
David W. Etherington, Kenneth D. Forbus, Matthew L. Ginsberg, David J. Israel, Vladimir Lifschitz
Critical Issues in Nonmonotonic Reasoning. KR (1989)
Matthew L. Ginsberg
A Circumscriptive Theorem Prover. Artif. Intell. 39 (2) (1989)
Andrew B. Baker, Matthew L. Ginsberg
A Theorem Prover for Prioritized Circumscription. IJCAI (1989)
Andrew B. Baker, Matthew L. Ginsberg
Temporal Projection and Explanation. IJCAI (1989)
Matthew L. Ginsberg
Ginsberg Replies of Chapman and Schoppers - Universal Planning Research: A Good or Bad Idea? AI Mag. 10 (4) (1989)
Matthew L. Ginsberg
A Circumscriptive Theorem Prover. AAAI (1988)
Matthew L. Ginsberg
Multivalued logics: a uniform approach to reasoning in artificial intelligence. Comput. Intell. 4 (1988)
Matthew L. Ginsberg, David E. Smith
Reasoning About Action II: The Qualification Problem. Artif. Intell. 35 (3) (1988)
Matthew L. Ginsberg, David E. Smith
Reasoning About Action I: A Possible Worlds Approach. Artif. Intell. 35 (2) (1988)
Matthew L. Ginsberg
A Circumscriptive Theorem Prover. NMR (1988)
Matthew L. Ginsberg
Reply to Cheeseman's An inquiry into computer understanding. Comput. Intell. 4 (1988)
Matthew L. Ginsberg, David E. Smith
Possible Worlds and the Qualification Problem. AAAI (1987)
Matthew L. Ginsberg
Multi-Valued Logics. AAAI (1986)
David E. Smith, Michael R. Genesereth, Matthew L. Ginsberg
Controlling Recursive Inference. Artif. Intell. 30 (3) (1986)
Matthew L. Ginsberg
Counterfactuals. Artif. Intell. 30 (1) (1986)
Michael R. Genesereth, Matthew L. Ginsberg, Jeffrey S. Rosenschein
Cooperation without Communication. AAAI (1986)
Matthew L. Ginsberg
Implementing Probabilistic Reasoning. UAI (1985)
Matthew L. Ginsberg
Counterfactuals. IJCAI (1985)
Michael R. Genesereth, Matthew L. Ginsberg
Logic Programming. Commun. ACM 28 (9) (1985)
Matthew L. Ginsberg
Does Probability Have a Place in Non-monotonic Reasoning? IJCAI (1985)
Matthew L. Ginsberg
Non-Monotonic Reasoning Using Dempster's Rule. AAAI (1984)