نتایج جستجو برای: founded metaphors

تعداد نتایج: 19977  

2004
Birte Lönneker Carina Eilts

This article deals with the question whether metaphors might be integrated into WordNets in a more systematic way. After outlining the advantages of having more information on metaphors in WordNets, it presents the Hamburg Metaphor Database and a possible method for integrating metaphors and corresponding equivalence relations into monolingual WordNets. Finally, problems are discussed that will...

2005
Pippin Barr Rilla Khaled James Noble Robert Biddle

User-interface metaphors are not well understood in terms of their relationships and qualities. They are, however, constantly used both consciously and unconsciously in most user-interface designs. This paper demonstrates a taxonomic classification and analysis of the user-interface metaphors in the Microsoft Office Project Gallery. The classification offers insight both into the nature of the ...

2006
Donald A. Carpenter Donna McAlister

Information technology (IT) professionals use metaphors extensively to reduce complexity for the novice user. Some metaphors are good; others, not. Some are clear; others, confusing. This paper explores several metaphors, then examines in depth one particular metaphor that may be harmful in its present inaccurate portrayal, that of the “machine cycle.” The goal is to enhance understanding of th...

Journal: :Política Común 2020

Journal: :DELTA: Documentação de Estudos em Lingüística Teórica e Aplicada 2006

2005
Christos Nomikos Panos Rondogiannis William W. Wadge

We consider the problem of strong equivalence [1] under the infinite-valued semantics [2] (which is a purely model-theoretic version of the well-founded semantics). We demonstrate that two programs are now strongly equivalent if and only if they are logically equivalent under the infinite-valued logic of [2]. In particular, we show that for propositional programs, strong equivalence is decidabl...

1997
Wolfgang May Bertram Ludäscher Georg Lausen

We present a well-founded semantics for deductive objectoriented database (dood) languages by applying the alternatingxpoint characterization of the well-founded model to them. In order to compute the state sequence, states are explicitly integrated by making them rst-class citizens of the underlying language. The concept is applied to Florid, an implementation of F-Logic, previously supporting...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید