Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

James M. Crawford

dblp:97/6981 · DBLP profile ↗
← Back
12ranked-venue papers
9as first author
0since 2021 · last 2002
0000-0003-3614-6055ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 11 · 9 first-authorGraphics, computer vision, multimedia, augmented reality and games · 6 · 6 first-authorTheory of computation · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
8 papers
Automated reasoning and model checking · 42% Logic in computer science · 23% Computational complexity · 21%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%
Artificial intelligence
5 papers
Knowledge representation and reasoning · 72% Vision and language · 22% Planning, search and constraint satisfaction · 6%

Topics — the 16 heaviest of 18, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automated reasoning and model checking
satisfiability
0.141996
Implicates and Prime Implicates in Random 3-SAT · Artif. Intell. 1996
Experimental Results on the Crossover Point in Random 3-SAT · Artif. Intell. 1996
Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems · AAAI 1994
Programming languages and type systems
language design
0.012002
R++: Adding Path-Based Rules to C++ · IEEE Trans. Knowl. Data Eng. 2002
Programming languages and type systems
object-oriented programming
0.012002
R++: Adding Path-Based Rules to C++ · IEEE Trans. Knowl. Data Eng. 2002
Automated reasoning and model checking › satisfiability › random k-SAT
random 3-SAT
0.021996
Implicates and Prime Implicates in Random 3-SAT · Artif. Intell. 1996
Experimental Results on the Crossover Point in Random 3-SAT · Artif. Intell. 1996
Algorithms and data structures › search algorithms
combinatorial search
0.011996
Symmetry-Breaking Predicates for Search Problems · KR 1996
Computational complexity › phase transition
phase transitions in combinatorial problems
0.011996
Experimental Results on the Crossover Point in Random 3-SAT · Artif. Intell. 1996
Computational complexity
search problems
0.011996
Symmetry-Breaking Predicates for Search Problems · KR 1996
Computer vision › Vision and language
affective reasoning
0.011995
Device Representation and Reasoning with Affective Relations · IJCAI 1995
Knowledge, reasoning and agents › Knowledge representation and reasoning
qualitative reasoning
0.021995
Formalising Reasoning about Change: A Qualitative Reasoning Approach · AAAI 1992
Device Representation and Reasoning with Affective Relations · IJCAI 1995
Algorithms and data structures › exact algorithms
satisfiability algorithms
0.011994
Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems · AAAI 1994
Computational complexity
phase transition
0.011993
Experimental Results on the Crossover Point in Satisfiability Problems · AAAI 1993
Knowledge, reasoning and agents › Knowledge representation and reasoning › reasoning about action and change
reasoning about change
0.011992
Formalising Reasoning about Change: A Qualitative Reasoning Approach · AAAI 1992
Logic in computer science › logic programming
negation
0.011991
Negation and Proof by Contradiction in Access-Limited Logic · AAAI 1991
Logic in computer science
proof theory
0.011991
Negation and Proof by Contradiction in Access-Limited Logic · AAAI 1991
Logic in computer science › knowledge representation and reasoning
knowledge representation
0.011989
Towards a Theory of Access-Limited Logic for Knowledge Representation · KR 1989
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
scheduling
0.011994
Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems · AAAI 1994

Methods — techniques the papers use, named apart from their topics

path-based rules · 0.0data-driven rules · 0.0access-limited logic · 0.0satisfiability solving · 0.0qualitative reasoning · 0.0symmetry breaking · 0.0probabilistic analysis · 0.0device representation · 0.0affective relations · 0.0experimental evaluation · 0.0
YearPublicationVenuePosition
2002 R++: Adding Path-Based Rules to C++
abstract
Object-oriented languages and rule-based languages offer two distinct and useful programming abstractions. However, previous attempts to integrate data-driven rules into object-oriented languages have typically achieved an uneasy union at best. R++ is a new, closer integration of the rule-based and object-oriented paradigms that extends C++ with a single programming construct, the path-based rule, as a new kind of class member. Path-based rules-data-driven rules that are restricted to following pointers between objects-are like automatic methods that are triggered by changes to the objects they monitor. Path-based rules provide a useful level of abstraction that encourages a more declarative style of programming and are valuable in object-oriented designs as a means of modeling dynamic collections of interdependent objects. Unlike more traditional pattern-matching rules, path-based rules are not at odds with the object-oriented paradigm and offer performance advantages for many natural applications.
Diane J. Litman, Peter F. Patel-Schneider, Anil Mishra, James M. Crawford, Daniel Dvorak
IEEE Trans. Knowl. Data Eng.4
1996 Symmetry-Breaking Predicates for Search Problems
James M. Crawford, Matthew L. Ginsberg, Eugene M. Luks, Amitabha Roy 0001
KR1
1996 Experimental Results on the Crossover Point in Random 3-SAT
James M. Crawford, Larry D. Auton
Artif. Intell.1
1996 Implicates and Prime Implicates in Random 3-SAT
Robert Schrag, James M. Crawford
Artif. Intell.2
1995 Device Representation and Reasoning with Affective Relations
James M. Crawford, Daniel Dvorak, Diane J. Litman, Anil Mishra, Peter F. Patel-Schneider
IJCAI1
1994 Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems
James M. Crawford, Andrew B. Baker
AAAI1
1993 Experimental Results on the Crossover Point in Satisfiability Problems
James M. Crawford, Larry D. Auton
AAAI1
1992 Formalising Reasoning about Change: A Qualitative Reasoning Approach
James M. Crawford, David W. Etherington
AAAI1
1992 Guaranteed Coverage Versus Intelligent Sampling: A Reply to Sacks and Doyle
Benjamin Kuipers, James M. Crawford
Comput. Intell.2
1991 Negation and Proof by Contradiction in Access-Limited Logic
James M. Crawford, Benjamin Kuipers
AAAI1
1990 QPC: A Compiler from Physical Models into Qualitative Differential Equations
James M. Crawford, Adam Farquhar, Benjamin Kuipers
AAAI1
1989 Towards a Theory of Access-Limited Logic for Knowledge Representation
James M. Crawford, Benjamin Kuipers
KR1