Beyond reification

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Literal Reification

In this paper we introduce the pattern literal reification, a modelling technique to address scenarios, in which we need to bless particular literals, usually when applying data properties, in order to use them as subjects and/or full-fledged objects of semantic assertions.

متن کامل

Theory propagation and reification

SAT Modulo Theories (SMT) is the problem of determining the satisfiability of a formula in which constraints, drawn from a given constraint theory T , are composed with logical connectives. The DPLL(T ) approach to SMT has risen to prominence as a technique for solving these quantifier-free problems. The key idea in DPLL(T ) is to couple unit propagation in the propositional part of the problem...

متن کامل

Reification of phonological storage.

We question the arguments and data presented by Larsen and Baddeley (this issue 2003) in support of the phonological loop account of verbal short-term memory on a number of grounds. These include the correlation between effect size and the presence of a phonological similarity effect in the data, and the existence elsewhere in the literature of effects of articulatory suppression and interferen...

متن کامل

Reification: a Marxist Perspective

The concept of reification is used by Marx to describe a form of social consciousness in which human relations come to be identified with the physical properties of things, thereby acquiring an appearance of naturalness and inevitability. This essay presents a systematic reconstruction of Marx's theory of reification, with an emphasis on the social-structural dimensions of the concept. This rec...

متن کامل

Half Reification and Flattening

Usually propagation-based constraint solvers construct a constraint network as a conjunction of constraints. They provide propagators for each form of constraint c. In order to increase expressiveness, systems also usually provide propagators for reified forms of constraints. A reified constraint b ↔ c associates a truth value b with a constraint c. With reified propagators, systems can express...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kontradikce

سال: 2018

ISSN: 2570-7485

DOI: 10.46957/con.2018.2.3