default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames M. Crawford
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j7]James M. Crawford:
Lessons Learned Delivering Optimized Supply Chain Planning to the Business World. AI Mag. 29(2): 51-53 (2008)- 2002
- [j6]Diane J. Litman, Peter F. Patel-Schneider, Anil Mishra, James M. Crawford, Daniel Dvorak:
R++: Adding Path-Based Rules to C++. IEEE Trans. Knowl. Data Eng. 14(3): 638-658 (2002)
1990 – 1999
- 1998
- [j5]Claude Le Pape, James M. Crawford, Barry Fox, Thomas Schiex:
Introduction to a Benchmark Column in CONSTRAINTS. Constraints An Int. J. 3(2/3): 255-256 (1998) - [c11]James M. Crawford, David W. Etherington:
A Non-Deterministic Semantics for Tractable Inference. AAAI/IAAI 1998: 286-291 - 1996
- [j4]James M. Crawford, Larry D. Auton:
Experimental Results on the Crossover Point in Random 3-SAT. Artif. Intell. 81(1-2): 31-57 (1996) - [j3]Robert Schrag, James M. Crawford:
Implicates and Prime Implicates in Random 3-SAT. Artif. Intell. 81(1-2): 199-222 (1996) - [c10]James M. Crawford, Daniel Dvorak, Diane J. Litman, Anil Mishra, Peter F. Patel-Schneider:
Path-Based Rules in Object-Oriented Programming. AAAI/IAAI, Vol. 1 1996: 490-497 - [c9]David W. Etherington, James M. Crawford:
Toward Efficient Default Reasoning. AAAI/IAAI, Vol. 1 1996: 627-632 - [c8]James M. Crawford, Matthew L. Ginsberg, Eugene M. Luks, Amitabha Roy:
Symmetry-Breaking Predicates for Search Problems. KR 1996: 148-159 - 1995
- [c7]James M. Crawford, Daniel Dvorak, Diane J. Litman, Anil Mishra, Peter F. Patel-Schneider:
Device Representation and Reasoning with Affective Relations. IJCAI 1995: 1814-1820 - 1994
- [c6]James M. Crawford, Andrew B. Baker:
Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems. AAAI 1994: 1092-1097 - 1993
- [c5]James M. Crawford, Larry D. Auton:
Experimental Results on the Crossover Point in Satisfiability Problems. AAAI 1993: 21-27 - 1992
- [j2]Benjamin Kuipers, James M. Crawford:
Guaranteed Coverage Versus Intelligent Sampling: A Reply to Sacks and Doyle. Comput. Intell. 8: 289-294 (1992) - [c4]James M. Crawford, David W. Etherington:
Formalising Reasoning about Change: A Qualitative Reasoning Approach. AAAI 1992: 577-583 - 1991
- [j1]James M. Crawford, Benjamin Kuipers:
Algernon - A Tractable System for Knowledge-Representation. SIGART Bull. 2(3): 35-44 (1991) - [c3]James M. Crawford, Benjamin Kuipers:
Negation and Proof by Contradiction in Access-Limited Logic. AAAI 1991: 897-903 - [p1]James M. Crawford, Benjamin Kuipers:
ALL: Formalizing Access-Limited Reasoning. Principles of Semantic Networks 1991: 299-330 - 1990
- [c2]James M. Crawford, Adam Farquhar, Benjamin Kuipers:
QPC: A Compiler from Physical Models into Qualitative Differential Equations. AAAI 1990: 365-372
1980 – 1989
- 1989
- [c1]James M. Crawford, Benjamin Kuipers:
Towards a Theory of Access-Limited Logic for Knowledge Representation. KR 1989: 67-78
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 2024-04-24 22:53 CEST 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:
