Ronald J. Brachman
- BRACHMAN, R. J., BORGIDA, A., McGUINNES, D. L., PATEL-SCHNEIDER, P. F., AND RESNICK, L. A 1991. Living with CLASSIC: When and how to use a KL-ONE like language. In Principles' of Semantic Networks, John Sowa, Ed., Morgan-Kaufman Publishers, San Mateo, CA, 401 456.]]Google Scholar
- LESPERANCE, Y, LEVESQUE, H, LIN, F, MARCU, D, REITER, R., AND SCHERL, R. 1994. A logical approach to high-level robot programming--a progress report In Control of the Physical World by Intelligent Systems, Papers from the 1994 AAA/Full Symposium (New Orleans, LA, Nov ) 109-119.]]Google Scholar
- McCARTHY, J. 1959. Programs with common sense. In Proceedings of the Tedd~ngton Conference on the Mechanization of Thought Processes, Her Majesty's Stationary Office, London, 75-91. Reproduced in Formal~ztn8 Common Sense: Papers by John McCarthy. 1990. Ablex, Norwood, NJ]] Google Scholar
Index Terms
- Undirected behavior without unbounded search
Recommendations
Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs
We prove that the strong perfect graph conjecture holds for graphs that do not contain parachutes or proper wheels. This is done by showing the following theorem: If a graph G contains no odd hole, no parachute and no proper wheel, then G is bipartite ...
Equitable colorings of planar graphs without short cycles
An equitable coloring of a graph is a proper vertex coloring such that the sizes of every two color classes differ by at most 1. Chen, Lih, and Wu conjectured that every connected graph G with maximum degree @D>=2 has an equitable coloring with @D ...
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
A graph G is edge-L-colorable, if for a given edge assignment L={L(e):e@__ __E(G)}, there exists a proper edge-coloring @f of G such that @f(e)@__ __L(e) for all e@__ __E(G). If G is edge-L-colorable for every edge assignment L with |L(e)|>=k for e@__ __...
Comments