Matthew L. Ginsberg

According to our database, Matthew L. Ginsberg authored at least 65 papers between 1984 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Unbalancing Binary Trees.

Matthew L. Ginsberg

CoRR, 2022

Automated Crossword Solving.

Eric Wallace, Nicholas Tomlin, Albert Xu, Kevin Yang, Eshaan Pathak, Matthew L. Ginsberg, Dan Klein

Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2022

2015

Satsisfiability and Systematicity.

Matthew L. Ginsberg

J. Artif. Intell. Res., 2015

2012

The Crossword Solver DR.FILL.

Matthew L. Ginsberg

J. Int. Comput. Games Assoc., 2012

2011

Dr.Fill: Crosswords and an Implemented Solver for Singly Weighted CSPs.

Matthew L. Ginsberg

J. Artif. Intell. Res., 2011

Green Driver: AI in a Microcosm.

Jim Apple, Paul Chang, Aran Clauson, Heidi E. Dixon, Hiba Fakhoury, Matthew L. Ginsberg, Erin Keenan, Alex Leighton, Kevin Scavezze, Bryan Smith

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2008

The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions.

Katrina Ray, Matthew L. Ginsberg

Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

2007

Of Mousetraps and Men: A Cautionary Tale.

Matthew L. Ginsberg

Proceedings of the Principles and Practice of Constraint Programming, 2007

2006

Stochastic shipyard simulation with SimYard.

Oliver Dain, Matthew L. Ginsberg, Erin Keenan, John M. Pyle, Tristan B. Smith, Andrew Stoneman, Iain Pardoe

Proceedings of the Winter Simulation Conference WSC 2006, 2006

2005

Generalizing Boolean Satisfiability III: Implementation.

Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes

J. Artif. Intell. Res., 2005

2004

Generalizing Boolean Satisfiability I: Background and Survey of Existing Work.

Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes

J. Artif. Intell. Res., 2004

Generalizing Boolean Satisfiability II: Theory.

Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes

J. Artif. Intell. Res., 2004

Implementing a Generalized Version of Resolution.

Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2002

Inference Methods for a Pseudo-Boolean Satisfiability Solver.

Heidi E. Dixon, Matthew L. Ginsberg

Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001

GIB: Imperfect Information in a Computationally Challenging Game.

Matthew L. Ginsberg

J. Artif. Intell. Res., 2001

2000

Report on the 1999 World Computer-Bridge Championship.

Matthew L. Ginsberg

J. Int. Comput. Games Assoc., 2000

Satisfiability Algorithms and Finite Quantification.

Matthew L. Ginsberg, Andrew J. Parkes

Proceedings of the KR 2000, 2000

1999

GIB: Steps Toward an Expert-Level Bridge-Playing Program.

Matthew L. Ginsberg

Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

1998

Supermodels and Robustness.

Matthew L. Ginsberg, Andrew J. Parkes, Amitabha Roy

Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1996

Procedural Reasoning in Constraint Satisfaction.

Ari K. Jónsson, Matthew L. Ginsberg

Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

Do Computers Need Common Sense?

Matthew L. Ginsberg

Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

A New Algorithm for Generative Planning.

Matthew L. Ginsberg

Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

Symmetry-Breaking Predicates for Search Problems.

James M. Crawford, Matthew L. Ginsberg, Eugene M. Luks, Amitabha Roy

Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

Partition Search.

Matthew L. Ginsberg

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995

Modality and Interrupts.

Matthew L. Ginsberg

J. Autom. Reason., 1995

Epistemological and Heuristic Adequacy Revisited.

Matthew L. Ginsberg

ACM Comput. Surv., 1995

Approximate Planning.

Matthew L. Ginsberg

Artif. Intell., 1995

Limited Discrepancy Search.

William D. Harvey, Matthew L. Ginsberg

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Systematic Versus Stochastic Constraint Satisfaction.

Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994

What Defaults can do that Hierarchies Can't.

Matthew L. Ginsberg, Hugh W. Holbrook

Fundam. Informaticae, 1994

GSAT and Dynamic Backtracking.

Matthew L. Ginsberg, David A. McAllester

Proceedings of the Principles and Practice of Constraint Programming, 1994

Approximate Planning (Extended Abstract).

Matthew L. Ginsberg

Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, 1994

1993

Dynamic Backtracking.

Matthew L. Ginsberg

J. Artif. Intell. Res., 1993

Essentials of Artificial Intelligence

Matthew L. Ginsberg

Morgan Kaufmann, ISBN: 1-55860-221-6, 1993

1992

Prolegomena to Any Future Prolegomena.

Matthew L. Ginsberg

Comput. Intell., 1992

Iterative Broadening.

Matthew L. Ginsberg, William D. Harvey

Artif. Intell., 1992

A Symbolic Generalization of Probability Theory.

Adnan Darwiche, Matthew L. Ginsberg

Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991

The MVL Theorem Proving System.

Matthew L. Ginsberg

SIGART Bull., 1991

Negative Subgoals with Free Variables.

Matthew L. Ginsberg

J. Log. Program., 1991

Knowledge Interchange Format: the KIF of Death.

Matthew L. Ginsberg

AI Mag., 1991

Marvin Minsky, The Society of Mind.

Matthew L. Ginsberg

Artif. Intell., 1991

The Computational Value of Nonmonotonic Reasoning.

Matthew L. Ginsberg

Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91). Cambridge, 1991

Computational Considerations in Reasoning about Action.

Matthew L. Ginsberg

Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91). Cambridge, 1991

Is There any Need for Domain-Dependent Control Information?

Matthew L. Ginsberg, Donald F. Geddis

Proceedings of the 9th National Conference on Artificial Intelligence, 1991

1990

Bilattices and Modal Operators.

Matthew L. Ginsberg

J. Log. Comput., 1990

Search Lessons Learned from Crossword Puzzles.

Matthew L. Ginsberg, Michael Frank, Michael P. Halpin, Mark C. Torrance

Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

1989

Ginsberg Replies of Chapman and Schoppers - Universal Planning Research: A Good or Bad Idea?

Matthew L. Ginsberg

AI Mag., 1989

Universal Planning: An (Almost) Universally Bad Idea.

Matthew L. Ginsberg

AI Mag., 1989

A Circumscriptive Theorem Prover.

Matthew L. Ginsberg

Artif. Intell., 1989

Critical Issues in Nonmonotonic Reasoning.

David W. Etherington, Kenneth D. Forbus, Matthew L. Ginsberg, David J. Israel, Vladimir Lifschitz

Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89). Toronto, 1989

Temporal Projection and Explanation.

Andrew B. Baker, Matthew L. Ginsberg

Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

A Theorem Prover for Prioritized Circumscription.

Andrew B. Baker, Matthew L. Ginsberg

Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

1988

Multivalued logics: a uniform approach to reasoning in artificial intelligence.

Matthew L. Ginsberg

Comput. Intell., 1988

Reply to Cheeseman's An inquiry into computer understanding.

Matthew L. Ginsberg

Comput. Intell., 1988

Reasoning About Action II: The Qualification Problem.

Matthew L. Ginsberg, David E. Smith

Artif. Intell., 1988

Reasoning About Action I: A Possible Worlds Approach.

Matthew L. Ginsberg, David E. Smith

Artif. Intell., 1988

1987

Possible Worlds and the Qualification Problem.

Matthew L. Ginsberg, David E. Smith

Proceedings of the 6th National Conference on Artificial Intelligence. Seattle, 1987

1986

Controlling Recursive Inference.

David E. Smith, Michael R. Genesereth, Matthew L. Ginsberg

Artif. Intell., 1986

Counterfactuals.

Matthew L. Ginsberg

Artif. Intell., 1986

Multi-Valued Logics.

Matthew L. Ginsberg

Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986

Cooperation without Communication.

Michael R. Genesereth, Matthew L. Ginsberg, Jeffrey S. Rosenschein

Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986

1985

Logic Programming.

Michael R. Genesereth, Matthew L. Ginsberg

Commun. ACM, 1985

Implementing Probabilistic Reasoning.

Matthew L. Ginsberg

Proceedings of the UAI '85: Proceedings of the First Annual Conference on Uncertainty in Artificial Intelligence, 1985

Does Probability Have a Place in Non-monotonic Reasoning?

Matthew L. Ginsberg

Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985

1984

Non-Monotonic Reasoning Using Dempster's Rule.

Matthew L. Ginsberg

Proceedings of the National Conference on Artificial Intelligence. Austin, 1984