Switch to: Citations

Add references

You must login to add references.
  1. Planning in a hierarchy of abstraction spaces.Earl D. Sacerdoti - 1974 - Artificial Intelligence 5 (2):115-135.
    Download  
     
    Export citation  
     
    Bookmark   119 citations  
  • (1 other version)Some Philosophical Problems from the Standpoint of Artificial Intelligence.J. McCarthy & P. J. Hayes - 1969 - Machine Intelligence 4:463-502.
    Download  
     
    Export citation  
     
    Bookmark   305 citations  
  • Calculating criticalities.A. Bundy, F. Giunchiglia, R. Sebastiani & T. Walsh - 1996 - Artificial Intelligence 88 (1-2):39-67.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Logic and artificial intelligence.Nils J. Nilsson - 1991 - Artificial Intelligence 47 (1-3):31-56.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Theorem proving with abstraction.David A. Plaisted - 1981 - Artificial Intelligence 16 (1):47-108.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Reasoning about model accuracy.Daniel S. Weld - 1992 - Artificial Intelligence 56 (2-3):255-300.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Prolegomena to a theory of mechanized formal reasoning.Richard W. Weyhrauch - 1980 - Artificial Intelligence 13 (1-2):133-170.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Planning as search: A quantitative approach.Richard E. Korf - 1987 - Artificial Intelligence 33 (1):65-88.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Approximate Semantic Transference: A Computational Theory of Metaphors and Analogies.Bipin Indurkhya - 1987 - Cognitive Science 11 (4):445-480.
    In this paper we start from the assumption that in a metaphor, or an analogy, some terms belonging to one domain (source domain) are used to refer to objects other than their conventional referents belonging to a possibly different domain (target domain). We describe a formalism, which is based on the First Order Predicate Calculus, for representing the knowledge structure associated with a domain and then develop a theory of Constrained Semantic Transference [CST] which allows the terms and the structural (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations