Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew L. Ginsberg
Person information
- affiliation: On Time Systems Inc, Eugene, OR, USA
- affiliation: University of Oregon, CIRL, Eugene, OR, USA
- affiliation: Stanford University, Computer Science Department, CA, USA
- affiliation (PhD 1980): Oxford University, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c39]Eric Wallace, Nicholas Tomlin, Albert Xu, Kevin Yang, Eshaan Pathak, Matthew L. Ginsberg, Dan Klein:
Automated Crossword Solving. ACL (1) 2022: 3073-3085- [i9]Eric Wallace, Nicholas Tomlin, Albert Xu, Kevin Yang, Eshaan Pathak, Matthew L. Ginsberg, Dan Klein:
Automated Crossword Solving. CoRR abs/2205.09665 (2022) - [i8]Matthew L. Ginsberg:
Unbalancing Binary Trees. CoRR abs/2208.14481 (2022)
2010 – 2019
- 2015
- [j30]Matthew L. Ginsberg:
Satsisfiability and Systematicity. J. Artif. Intell. Res. 53: 497-540 (2015) - 2014
- [i7]Matthew L. Ginsberg:
Dr.Fill: Crosswords and an Implemented Solver for Singly Weighted CSPs. CoRR abs/1401.4597 (2014) - 2013
- [i6]Matthew L. Ginsberg:
Implementing Probabilistic Reasoning. CoRR abs/1304.3428 (2013) - 2012
- [j29]Matthew L. Ginsberg:
The Crossword Solver DR.FILL. J. Int. Comput. Games Assoc. 35(2): 80-89 (2012) - 2011
- [j28]Matthew L. Ginsberg:
Dr.Fill: Crosswords and an Implemented Solver for Singly Weighted CSPs. J. Artif. Intell. Res. 42: 851-886 (2011) - [c38]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: 1311-1316 - [i5]Matthew L. Ginsberg:
GIB: Imperfect Information in a Computationally Challenging Game. CoRR abs/1106.0669 (2011) - [i4]Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes:
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work. CoRR abs/1107.0040 (2011) - [i3]Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes:
Generalizing Boolean Satisfiability II: Theory. CoRR abs/1109.2134 (2011) - [i2]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)
2000 – 2009
- 2008
- [c37]Katrina Ray, Matthew L. Ginsberg:
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions. ICAPS 2008: 280-287 - 2007
- [c36]Matthew L. Ginsberg:
Of Mousetraps and Men: A Cautionary Tale. CP 2007: 2 - 2006
- [c35]Oliver Dain, Matthew L. Ginsberg, Erin Keenan, John M. Pyle, Tristan B. Smith, Andrew Stoneman, Iain Pardoe:
Stochastic shipyard simulation with SimYard. WSC 2006: 1770-1778 - 2005
- [j27]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: 441-531 (2005) - 2004
- [j26]Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes:
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work. J. Artif. Intell. Res. 21: 193-243 (2004) - [j25]Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes:
Generalizing Boolean Satisfiability II: Theory. J. Artif. Intell. Res. 22: 481-534 (2004) - [c34]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 - 2002
- [c33]Heidi E. Dixon, Matthew L. Ginsberg:
Inference Methods for a Pseudo-Boolean Satisfiability Solver. AAAI/IAAI 2002: 635-640 - 2001
- [j24]Matthew L. Ginsberg:
GIB: Imperfect Information in a Computationally Challenging Game. J. Artif. Intell. Res. 14: 303-358 (2001) - 2000
- [j23]Matthew L. Ginsberg:
Report on the 1999 World Computer-Bridge Championship. J. Int. Comput. Games Assoc. 23(2): 111-114 (2000) - [c32]Matthew L. Ginsberg, Andrew J. Parkes:
Satisfiability Algorithms and Finite Quantification. KR 2000: 690-701
1990 – 1999
- 1999
- [c31]Matthew L. Ginsberg:
GIB: Steps Toward an Expert-Level Bridge-Playing Program. IJCAI 1999: 584-593 - 1998
- [c30]Matthew L. Ginsberg, Andrew J. Parkes, Amitabha Roy:
Supermodels and Robustness. AAAI/IAAI 1998: 334-339 - 1996
- [c29]Matthew L. Ginsberg:
Partition Search. AAAI/IAAI, Vol. 1 1996: 228-233 - [c28]James M. Crawford, Matthew L. Ginsberg, Eugene M. Luks, Amitabha Roy:
Symmetry-Breaking Predicates for Search Problems. KR 1996: 148-159 - [c27]Ari K. Jónsson, Matthew L. Ginsberg:
Procedural Reasoning in Constraint Satisfaction. KR 1996: 160-171 - [c26]Matthew L. Ginsberg:
A New Algorithm for Generative Planning. KR 1996: 186-197 - [c25]Matthew L. Ginsberg:
Do Computers Need Common Sense? KR 1996: 620-626 - 1995
- [j22]Matthew L. Ginsberg:
Approximate Planning. Artif. Intell. 76(1-2): 89-123 (1995) - [j21]Matthew L. Ginsberg:
Epistemological and Heuristic Adequacy Revisited. ACM Comput. Surv. 27(3): 331-333 (1995) - [j20]Matthew L. Ginsberg:
Modality and Interrupts. J. Autom. Reason. 14(1): 43-91 (1995) - [c24]William D. Harvey, Matthew L. Ginsberg:
Limited Discrepancy Search. IJCAI (1) 1995: 607-615 - [c23]Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang:
Systematic Versus Stochastic Constraint Satisfaction. IJCAI 1995: 2027-2032 - 1994
- [j19]Matthew L. Ginsberg, Hugh W. Holbrook:
What Defaults can do that Hierarchies Can't. Fundam. Informaticae 21(1/2): 149-159 (1994) - [c22]Matthew L. Ginsberg:
Approximate Planning (Extended Abstract). AIPS 1994: 68-73 - [c21]Matthew L. Ginsberg, David A. McAllester:
GSAT and Dynamic Backtracking. KR 1994: 226-237 - [c20]Matthew L. Ginsberg, David A. McAllester:
GSAT and Dynamic Backtracking. PPCP 1994: 243-265 - 1993
- [b1]Matthew L. Ginsberg:
Essentials of Artificial Intelligence. Morgan Kaufmann 1993, ISBN 1-55860-221-6 - [j18]Matthew L. Ginsberg:
Dynamic Backtracking. J. Artif. Intell. Res. 1: 25-46 (1993) - [i1]Matthew L. Ginsberg:
Dynamic Backtracking. CoRR cs.AI/9308101 (1993) - 1992
- [j17]Matthew L. Ginsberg, William D. Harvey:
Iterative Broadening. Artif. Intell. 55(2): 367-383 (1992) - [j16]Matthew L. Ginsberg:
Prolegomena to Any Future Prolegomena. Comput. Intell. 8: 253-256 (1992) - [c19]Adnan Darwiche, Matthew L. Ginsberg:
A Symbolic Generalization of Probability Theory. AAAI 1992: 622-627 - 1991
- [j15]Matthew L. Ginsberg:
Marvin Minsky, The Society of Mind. Artif. Intell. 48(3): 335-339 (1991) - [j14]Matthew L. Ginsberg:
Knowledge Interchange Format: the KIF of Death. AI Mag. 12(3): 57-63 (1991) - [j13]Matthew L. Ginsberg:
Negative Subgoals with Free Variables. J. Log. Program. 11(3&4): 271-293 (1991) - [j12]Matthew L. Ginsberg:
The MVL Theorem Proving System. SIGART Bull. 2(3): 57-60 (1991) - [c18]Matthew L. Ginsberg, Donald F. Geddis:
Is There any Need for Domain-Dependent Control Information? AAAI 1991: 452-457 - [c17]Matthew L. Ginsberg:
Computational Considerations in Reasoning about Action. KR 1991: 250-261 - [c16]Matthew L. Ginsberg:
The Computational Value of Nonmonotonic Reasoning. KR 1991: 262-268 - 1990
- [j11]Matthew L. Ginsberg:
Bilattices and Modal Operators. J. Log. Comput. 1(1): 41-69 (1990) - [c15]Matthew L. Ginsberg, Michael Frank, Michael P. Halpin, Mark C. Torrance:
Search Lessons Learned from Crossword Puzzles. AAAI 1990: 210-215 - [c14]Matthew L. Ginsberg, William D. Harvey:
Iterative Broadening. AAAI 1990: 216-220 - [c13]Matthew L. Ginsberg:
Bilattices and Modal Operators. TARK 1990: 273-287
1980 – 1989
- 1989
- [j10]Matthew L. Ginsberg:
A Circumscriptive Theorem Prover. Artif. Intell. 39(2): 209-230 (1989) - [j9]Matthew L. Ginsberg:
Universal Planning: An (Almost) Universally Bad Idea. AI Mag. 10(4): 40-44 (1989) - [j8]Matthew L. Ginsberg:
Ginsberg Replies of Chapman and Schoppers - Universal Planning Research: A Good or Bad Idea? AI Mag. 10(4): 61-62 (1989) - [c12]Andrew B. Baker, Matthew L. Ginsberg:
A Theorem Prover for Prioritized Circumscription. IJCAI 1989: 463-467 - [c11]Andrew B. Baker, Matthew L. Ginsberg:
Temporal Projection and Explanation. IJCAI 1989: 906-911 - [c10]David W. Etherington, Kenneth D. Forbus, Matthew L. Ginsberg, David J. Israel, Vladimir Lifschitz:
Critical Issues in Nonmonotonic Reasoning. KR 1989: 500-504 - [e1]Michael Reinfrank, Johan de Kleer, Matthew L. Ginsberg, Erik Sandewall:
Non-Monotonic Reasoning, 2nd International Workshop, Grassau, FRG, June 13-15, 1988, Proceedings. Lecture Notes in Computer Science 346, Springer 1989, ISBN 3-540-50701-9 [contents] - 1988
- [j7]Matthew L. Ginsberg, David E. Smith:
Reasoning About Action I: A Possible Worlds Approach. Artif. Intell. 35(2): 165-195 (1988) - [j6]Matthew L. Ginsberg, David E. Smith:
Reasoning About Action II: The Qualification Problem. Artif. Intell. 35(3): 311-342 (1988) - [j5]Matthew L. Ginsberg:
Reply to Cheeseman's An inquiry into computer understanding. Comput. Intell. 4: 77-78 (1988) - [j4]Matthew L. Ginsberg:
Multivalued logics: a uniform approach to reasoning in artificial intelligence. Comput. Intell. 4: 265-316 (1988) - [c9]Matthew L. Ginsberg:
A Circumscriptive Theorem Prover. AAAI 1988: 470-474 - [c8]Matthew L. Ginsberg:
A Circumscriptive Theorem Prover. NMR 1988: 100-114 - 1987
- [c7]Matthew L. Ginsberg, David E. Smith:
Possible Worlds and the Qualification Problem. AAAI 1987: 212-217 - 1986
- [j3]Matthew L. Ginsberg:
Counterfactuals. Artif. Intell. 30(1): 35-79 (1986) - [j2]David E. Smith, Michael R. Genesereth, Matthew L. Ginsberg:
Controlling Recursive Inference. Artif. Intell. 30(3): 343-389 (1986) - [c6]Michael R. Genesereth, Matthew L. Ginsberg, Jeffrey S. Rosenschein:
Cooperation without Communication. AAAI 1986: 51-57 - [c5]Matthew L. Ginsberg:
Multi-Valued Logics. AAAI 1986: 243-249 - 1985
- [j1]Michael R. Genesereth, Matthew L. Ginsberg:
Logic Programming. Commun. ACM 28(9): 933-941 (1985) - [c4]Matthew L. Ginsberg:
Counterfactuals. IJCAI 1985: 80-86 - [c3]Matthew L. Ginsberg:
Does Probability Have a Place in Non-monotonic Reasoning? IJCAI 1985: 107-110 - [c2]Matthew L. Ginsberg:
Implementing Probabilistic Reasoning. UAI 1985: 331-338 - 1984
- [c1]Matthew L. Ginsberg:
Non-Monotonic Reasoning Using Dempster's Rule. AAAI 1984: 126-129
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-12-11 20:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
