نتایج جستجو برای: mental model completeness scale

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

Renu ., S. P. Tiwari

In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...

2013
Wulf-Dieter Geyer Moshe Jarden

We present a theorem of Kollár on the density property of valued PAC fields and a theorem of Abraham Robinson on the model completeness of the theory of algebraically closed non-trivial valued fields. Then we prove that the theory T of non-trivial valued fields in an appropriate first order language has a model completion T̃ . The models of T̃ are non-trivial valued fields (K, v) that are ω-imper...

2011
Daniel Kroening Joël Ouaknine Ofer Strichman Thomas Wahl James Worrell

Bounded model checking is a symbolic bug-finding method that examines paths of bounded length for violations of a given LTL formula. Its rapid adoption in industry owes much to advances in SAT technology over the past 10–15 years. More recently, there have been increasing efforts to apply SAT-based methods to unbounded model checking. One such approach is based on computing a completeness thres...

2012
Alessandro Ferrari Jacinto Fabio Gazelato de Melo Franco Miriam Ikeda Ribeiro Vanessa de Albuquerque Citero

Conflict of interest: none. ABSTRACT Objective: To evaluate the diagnostic sensitivity, specificity, and agreement of the Dementia Rating Scale with clinical diagnosis of cognitive impairment and to compare its psychometric measures with those from Mini Mental State Examination. Methods: Eighty-six elders from a long-term care institution were invited to participate in a study, and fifty-eight ...

Journal: :The Proceedings of the Annual Convention of the Japanese Psychological Association 2017

2004
Edmund M. Clarke Daniel Kroening Joël Ouaknine Ofer Strichman

For every finite model M and an LTL property φ, there exists a number CT (the Completeness Threshold) such that if there is no counterexample to φ in M of length CT or less, then M |= φ. Finding this number, if it is sufficiently small, offers a practical method for making Bounded Model Checking complete. We describe how to compute an over-approximation to CT for a general LTL property using Bü...

1950

pr. Sarason has attempted to cover the whole ? ^ of mental deficiency in this book, and this has Evolved deliberate emphasis of certain types and a rather cursory dismissal of others. It is not easy to write such a book for clinical and ^?cial workers, psychiatrists and psychologists, and Wiere the whole emphasis tends to be on the Psychology of mental deficiency it is questionable Primary amen...

Journal: :Proceedings of the American Mathematical Society 2000

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

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