171,160 Hits in 5.7 sec

A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics [chapter]

Christos Nomikos, Panos Rondogiannis, William W. Wadge
2005 Lecture Notes in Computer Science  
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).  ...  Our results have a direct practical implication for the well-founded semantics since, as we demonstrate, if two programs are strongly equivalent under the infinite-valued semantics, then they are also  ...  We consider the problem of characterizing the notion of strong equivalence under the infinitevalued semantics of [2] (which is actually a refined version of the well-founded semantics).  ... 
doi:10.1007/11562931_35 fatcat:3evcqjuzdfe7vbppeqlhw52f3q

Page 4535 of Mathematical Reviews Vol. , Issue 93h [page]

1993 Mathematical Reviews  
Hence, stable semantics can be considered as ‘two-valued well-founded semantics’. (2) An axiomatic characterization of stable and well-founded semantics of logic programs is given by a new completion theory  ...  semantics and well-founded semantics.  ... 

Psycho-Semantic Methods in the Study of the Phenomenon of Loneliness

Zh V Puzanova
2011 RUDN journal of Sociology  
In this instance, the article describes the application of psycho-semantic methods used in combination with the method of unfinished sentences.  ...  In the article the author continues to introduce the reader to the findings of the exploratory research aimed to reconstruct some structural elements of the phenomenon of loneliness.  ...  This factor explains 13% of variables and is characterized by the adjectives simple, hostile and regular.  ... 
doaj:988fb9c6cb4447099ab0d00b0bd7d6ad fatcat:bgvotmkpabechkhvpxiglke5lu

Page 3380 of Mathematical Reviews Vol. , Issue 92f [page]

1992 Mathematical Reviews  
Another important result is that our removal semantics (the contradiction removal semantics) is de- fined as the well-founded model of a derived program obtained by a simple transformation from the original  ...  Summary: “Our purpose is to define a semantics that extends well-founded semantics for programs with classical negation, and which avoids the absence of models caused by contradictions brought about by  ... 

Page 7760 of Mathematical Reviews Vol. , Issue 96m [page]

1996 Mathematical Reviews  
] (1-STF-C; Stanford, CA) A nondeterministic well-founded semantics.  ...  We show that the skeptical case corresponds to the well-founded semantics and that the nondeterministic case computes a sound subclass of well-founded hypotheses.  ... 

Generation and synchronous tree-adjoining grammars

Stuart M. Shieber, Yves Schabes
1991 Computational intelligence  
dependencies as well, in turn serving as an aid to generation from semantic representations.  ...  Furthermore, the semantic monotonicity requirement previously advocated for generation grammars as a computational aid is seen to be an inherent property of synchronous TAGs.  ...  semantic operations to be well-defined.  ... 
doi:10.1111/j.1467-8640.1991.tb00396.x fatcat:3kje6f6ahjdwtaat4pi6q4mxv4

Page 2044 of Mathematical Reviews Vol. , Issue 99c [page]

1991 Mathematical Reviews  
This construction is a generalization of a description of the well-founded semantics: we introduce a very simple and neat con- struction of a sequence D, that eventually stops and represents the set of  ...  {For the entire collection see MR 99a:68013.} 99c:68036 68N17 03B70 Brass, Stefan (D-HANN-I; Hannover); Dix, Jiirgen Characterizations of the disjunctive well-founded semantics: confluent calculi and iterated  ... 


Yanina Tahiltseva, Yuliia Nikolaienko
2019 Naukovì zapiski Nacìonalʹnogo unìversitetu «Ostrozʹka akademìâ». Serìâ «Fìlologìâ»  
Compound adjectives used to describe a person's character may consist of two simple or two derived stems and also have one component with a derived stem expressed by Participle I, Participle II or noun  ...  A specific group made up of composites with such components as -tempered, -minded, -self and -headed has been analyzed. The variants in writing (as one word or with a hyphen) are considered as well.  ...  Composites with two derived stems can also be found in the researched vocabulary, for instance, worldly / spiritually-minded.  ... 
doi:10.25264/2519-2558-2019-7(75)-84-87 fatcat:rbhsiuu7zvbe5oa5esk3tkezae

Lost in Translation: Data Integration Tools Meet the Semantic Web (Experiences from the Ondex Project) [chapter]

Andrea Splendiani, Chris J. Rawlings, Shao-Chih Kuo, Robert Stevens, Phillip Lord
2012 Lecture Notes in Electrical Engineering  
We report in the paper on the simple methodology that we have adopted to conduct such analysis, and on issues that we have found which may be relevant for a range of similar platforms  ...  A number of features, including semantic annotation via ontologies and an attention to provenance and evidence, make this an ideal candidate to consume Semantic Web information, as well as a prototype  ...  Rothamsted Research is in receipt of grant in aid from the BBSRC.  ... 
doi:10.1007/978-3-642-28798-5_13 fatcat:nrvrqd4b5bgzvnltdzlnoozvke

Page 194 of Behavior Research Methods Vol. 30, Issue 2 [page]

1998 Behavior Research Methods  
of co-occurrence]) found in the word vector.  ...  In this section, two analyses of grammatical class will be presented that show that HAL’s vector representations encode grammatical-class information as well as se¬ mantic information.  ... 

Guest editor's introduction

Teodor Przymusinski
1993 The Journal of Logic Programming  
well-founded semantics.  ...  of the latter two semantics.  ... 
doi:10.1016/0743-1066(93)90027-e fatcat:462wwnsv3vb4bbwdofceogtvvi

Disjunctive logic programming and autoepistemic logic [chapter]

Li -Yan Yuan, Jia -Huai You, Randy Goebel
1998 Lecture Notes in Computer Science  
We have observed that two different types of negative introspection in autoepistemic reasoning present two different interpretations of default negation: consistency-based and minimal-model-based.  ...  We also observed that all logic program semantics fall into three semantical points of view: the skeptical, stable, and partial-stable.  ...  Proposition 1. ([21]) The well-founded semantics is characterized by the least partial-stable set. 2. The stable semantics is characterized by the set of all stable sets. 3.  ... 
doi:10.1007/bfb0054791 fatcat:dmbwpa4grjegxlmgpffpvl2nmq

Exploring adjectival modification in biomedical discourse across two genres

Olivier Bodenreider, Serguei V. Pakhomov
2003 Proceedings of the ACL 2003 workshop on Natural language processing in biomedicine -  
Discussion: Potential applications of this approach are discussed, namely terminology acquisition, information retrieval, and genre characterization.  ...  For disorder phrases, the 38% of adjective types common to the two corpora account for 85% of the occurrences. The predominance of adjectives in one corpus is analyzed.  ...  Since most of them are semantically valid, we found it convenient to keep all demodified phrases for further analysis.  ... 
doi:10.3115/1118958.1118972 dblp:conf/bionlp/BodenreiderP03 fatcat:3loti25i5ndzfmuwqaseo6w5zy

Proof method of partial correctness and weak completeness for normal logic programs

Gérard Ferrand, Pierre Deransart
1993 The Journal of Logic Programming  
This research was supported in part by CNRS (Orltans and METHEOL project of the GRECO Programmation). Thanks are due to the anonymous referees for their comments and suggestions.  ...  CHARACTERIZATION OF THE WELL-FOUNDED MODEL Now, [271 defines the well-founded model Mp of any normal program P and [23] proves that MP is the c -minimum stable model of P ([4] and [9]> give a simple  ...  We consider that the actual semantics of a normal program is the three-valued well-founded semantics.  ... 
doi:10.1016/0743-1066(93)90033-d fatcat:azn34bec5vce3nihagl2ic4bgq

Page 129 of Computational Linguistics Vol. 16, Issue 2 [page]

1990 Computational Linguistics  
Using this notion, it is a simple matter to show that metaphor involves the close and unconventional associating of two different domains.  ...  Repetition performance on metaphors was compared with repetitions of semantically well-formed literal sentences as well as semantically anomalous sentences, all matched for length, vocabulary, and sentence  ... 
« Previous Showing results 1 — 15 out of 171,160 results