Charles Rich
Skip Abstract Section
Abstract
The particular combination of facilities implemented in CAKE is motivated by the need to support research in automatic programing, rather than any specific set of research questions in knowledge representation and reasoning. Nevertheless, we believe CAKE epitomizes two central challenges in the current state of the art in knowledge representation and reasoning: How do we develop a principled approach to hybrid systems, and how do we learn to live with limited reasoning capabilities?
- R. J. Brachman and H. J. Levesque. The tractability of subsumption in frame-based description languages. In Proc. 4th National Conf. on Artificial Intelligence, Austin, TX, August 1984.Google Scholar
- D. Brotsky and C. Rich. Issues in the design of hybrid knowledge representation and reasoning systems. In Proc. Workshop on Theoretical Issues in Natural Language Understanding, Halifax, Canada, May 1985.Google Scholar
- A. G. Cohn. A more expressive formulation of many sorted logic. J. Automated Reasoning, 3(2):113--200, June 1987. Google ScholarDigital Library
- A. G. Cohn. Many many sorted logics. In AAAI Workshop on Principles of Hybrid Reasoning, St. Paul, MN, August 1988.Google Scholar
- Y. A. Feldman and C. Rich. Reasoning with simplifying assumptions: A methodology and example. In Proc. 5th National Conf. on Artificial Intelligence, pages 2--7, Philadelphia, PA, August 1986.Google Scholar
- Y. A. Feldman and C. Rich. Bread, Frappe, and Cake: The gourmet's guide to automated deduction. In Proc. 5th Israeli Symp. on Artificial Intelligence, Vision, and Pattern Recognition, Tel Aviv, Israel, December 1988.Google Scholar
- Y. A. Feldman and C. Rich. Principles of knowledge representation and reasoning in the FRAPPE system. In Proc. 6th Israeli Symp. on Artificial Intelligence, Tel Aviv, Israel, December 1989.Google Scholar
- Y. A. Feldman and C. Rich. Pattern-directed invocation with changing equations. J. Automated Reasoning, Accepted for publication. Google ScholarDigital Library
- A. M. Frisch. A general framework for sorted deduction: Fundamental results on hybrid reasoning. In Proc. 1st Int. Conf. on Principles of Knowledge Representation and Reasoning, Toronto, Canada, May 1989. Submitted. Google ScholarDigital Library
- R. I. Kuper. Dependency-directed localization of software bugs. Technical Report 1053, MIT Artificial Intelligence Lab., May 1989. Master's thesis. Google ScholarDigital Library
- H. J. Levesque. Making believers out of computers. Artificial Intelligence, 30(1):81--108, October 1986. Google ScholarDigital Library
- A. K. Macworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99--118, February 1977.Google ScholarDigital Library
- D. A. McAllester. An outlook on truth maintenance. Memo 551, MIT Artificial Intelligence Lab., August 1980.Google Scholar
- D. A. McAllester. Reasoning utility package user's manual. Memo 667, MIT Artificial Intelligence Lab., April 1982.Google Scholar
- S. A. Miller and L. K. Schubert. Using specialists to accelerate general reasoning. In Proc. 7th National Conf. on Artificial Intelligence, St. Paul, MN, August 1988.Google Scholar
- G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Trans. Programming Languages and Systems, 1(2), October 1979. Google ScholarDigital Library
- G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. J. ACM, 27(2):356--364, April 1980. Google ScholarDigital Library
- H. B. Reubenstein and R. C. Waters. The Requirements Apprentice: Automated assistance for requirements acquisition. IEEE Trans. Software Engineering, 17(3), March 1991. Google ScholarDigital Library
- C. Rich. A formal representation for plans in the Programmer's Apprentice. In Proc. 7th Int. Joint Conf. Artificial Intelligence, pages 1044--1052, Vancouver, British Columbia, Canada, August 1981. Reprinted in M. Brodie, J. Mylopoulos, and J. Schmidt, editors, On Conceptual Modelling, pages 239--270, Springer-Verlag, New York, NY, 1984, and in C. Rich and R. C. Waters, editors, Readings in Artificial Intelligence and Software Engineering, Morgan Kaufmann, 1986. Google ScholarDigital Library
- C. Rich and R. C. Waters. The Programmer's Apprentice: A research overview. IEEE Computer, 21(11):10--25, November 1988. Reprinted in D. Patridge, editor, Artificial Intelligence and Software Engineering, Ablex, Norwood, NJ, In press, and in P. H. Winston with S. A. Shellard, editors, Artificial Intelligence at MIT:Expanding Frontiers, pages 166--195, MIT Press, Cambridge, MA, 1990. Google ScholarDigital Library
- C. Rich and R. C. Waters. The Programmer's Apprentice. Addison-Wesley, Reading, MA and ACM Press, Baltimore, MD, 1990. Google Scholar
- C. Rich et al. Programmer's guide to the Bread, Frappe, and Cake knowledge representation and reasoning systems. MIT AI Laboratory, Draft, 1990.Google Scholar
- R. B. Roberts and I. P. Goldstein. The FRL manual. Memo 409, MIT Artificial Intelligence Lab., September 1977. Google ScholarDigital Library
- S. Rowley, H. E. Shrobe, and R. Cassels. Joshua: Uniform access to heterogenous knowledge structures or why joshing is better than conniving or planning. In Proc. 6th National Conf. on Artificial Intelligence, Seattle, WN, August 1987.Google Scholar
- G. L. Steele Jr. Common Lisp: The Language (Second Edition). Digital Press, Burlington, MA, 1990. Google ScholarDigital Library
- G. J. Sussman and G. L. Steele. CONSTRAINTS---A language for expressing almost-hierarchical descriptions. Artificial Intelligence, 14(1):1--40, 1980.Google ScholarDigital Library
- Y. M. Tan. Supporting reuse and evolution in software design. Memo 1256, MIT Artificial Intelligence Lab., October 1990. Master's thesis. Google ScholarDigital Library
- L. M. Wills. Automated program recognition: A feasibility demonstration. Artificial Intelligence, 45(1--2):113--172, September 1990. Google ScholarDigital Library
Index Terms
- CAKE: an implemented hybrid knowledge representation and limited reasoning system
Recommendations
Penguins Can Make Cake
This article is a reply to Matthew Ginsberg's article entitled “Universal Planning: An (Almost) Universally Had Idea.” Ginsberg argues that universal plans are infeasible for reasons of computational complexity and concludes that classical planning—or ...
The Collaborative Agile Knowledge Engine CAKE
GROUP '14: Proceedings of the 2014 ACM International Conference on Supporting Group WorkThe Collaborative Agile Knowledge Engine (CAKE) is a prototypical generic software system for integrated process and knowledge management. CAKE integrates recent research results on agile workflows, process-oriented case-based reasoning, and web ...
Formalizing defeasible logic in CAKE
Due to its efficiency, defeasible logic is one of the most interesting non-monotonic formalisms. Unfortunately, the logic has one major limitation: it does not properly deal with cyclic defeasible rules.In this paper, we provide a new variant of ...
Comments