Skip to search formSkip to main contentSkip to account menu

Bart Selman

Bart Selman is an American professor of computer science at Cornell University. He used to be at AT&T Bell Laboratories. He has authored over 90… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Should some rights to engage in international trade be made conditional on the promotion of labor standards? The critics of such… 
2006
2006
Bats seldom soar because it is behaviour generally associated with the use of thermals, which are normally of insufficient… 
2006
2006
The idea of encoding planning as satisfiability was proposed in 1992 as a method for generating interesting SAT problems, but did… 
2004
2004
The constraint satisfaction problem (CSP) is a framework for modelling search problems. An instance of the CSP consists of a set… 
Highly Cited
2003
Highly Cited
2003
A powerful methodology for scenario-based specification of reactive systems is described, in which the behavior is “played in… 
1991
1991
We demonstrate differences between reducibilities and corresponding completeness notions for nondeterministic time and space… 
1988
1988
Most theories of presupposition implicitly assume that presuppositions are facts, and that all agents involved in a discourse… 
1983
1983
Novacastria nothofagi Selman, a new species and genus, is described and illustrated. A new key is produced to the genera related…