نتایج جستجو برای: deductive c r task
تعداد نتایج: 1675702 فیلتر نتایج به سال:
The general purpose of this paper is to show a practical instance of how philosophy can benefit from some ideas, methods and techniques developed in the field of Artificial Intelligence (AI). It has to do with some recent claims [4] that some of the most traditional philosophical problems have been raised and, in some sense, solved by AI researchers. The philosophical problem we will deal with ...
We used the "standard" and "switched" social contract versions of the Wason Selection-task to investigate the neural bases of human reasoning about social rules. Both these versions typically elicit the deontically correct answer, i.e. the proper identification of the violations of a conditional obligation. Only in the standard version of the task, however, this response corresponds to the logi...
در این پایان نامه مفهومی از خاصیت(t) برای یک *c -جبر دلخواه را که یک حالت اثر را می پذیرد، تعریف می شود، سپس این مفهوم به یک مفهوم خاصیت(t) برای جفت (a,b) بسط داده می شود، به طوری که b یک *c-زیرجبر از a است. فرض کنید g یک گروه گسسته و (c*r(g جبر کاهشی آن باشد. نشان داده می شود که (c*r(g خاصیت(t) دارد اگر و فقط اگر گروه g خاصیت(t) دارد. به طور کلی، بازای هر زیرگروه بسته h از g، جفت (g,h)خاصیت(t)...
Implementation is ubiquitous. The identification of barriers to implementation critical for achieving success. This paper introduces and discusses a deductive theory-based framework, TASKS, guide the barriers. TASKS framework deals with relationships between Task task implementer’s Affect, Skills, Knowledge, based on inversed U-shaped mental Stress-mental effort relation. classifies into four c...
This paper presents an extension to deductive databases, called quantified deductive databases, that incorporates universally quantified expressions (in coded form) in the body of rules. Since universally quantified expressions contain negations in their semantics, quantified deductive databases fall under the category of deductive databases with negation. Furthermore, depending on other factor...
PRISM (a P a r a l l e l Inference System), f o r p a r a l l e l execution of problems, has been implemented on ZMOB (Rieger [1980 ] ) . PRISM is an experimental t o o l fo r the development of d i s t r i b u t e d AI problem solvers and is based on l og i c programming. F a m i l i a r i t y w i th log ic programming (Kowalski [1979]) is assumed. In conventional programming systems the log i...
A b s t r a c t. In recent work the notion of a secrecy logicS over a given deductive system S was introduced. Secrecy logics capture the essential features of structures that are used in performing secrecy-preserving reasoning in practical applications. More precisely, they model knowledge bases that consist of information, part of which is considered known to the user and part of which is to ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید