نتایج جستجو برای: existential reasons

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

Journal: :CoRR 2014
Guy Van den Broeck Wannes Meert Adnan Darwiche

First-order model counting emerged recently as a novel reasoning task, at the core of efficient algorithms for probabilistic logics. We present a Skolemization algorithm for model counting problems that eliminates existential quantifiers from a first-order logic theory without changing its weighted model count. For certain subsets of first-order logic, lifted model counters were shown to run in...

Journal: :Territori 2021

Liguria was the great ‘action scenario’ for Massimo Quaini. A region that, thanks to historical and environmental conditions, allowed him read in advance phenomena dynamics that would later occur at a national scale. This contribution does not pretend exhaust substance of relationship goes beyond scientific level involves deep existential bonds, but only provide some elements draw first map rea...

Journal: :Verbum Christi : Jurnal teologi Reformed Injili 2022

Christian teachers do not naturally connect theology with their professional practice. This article explores the reasons for this, which all have to how theory functions in teaching. Theory will mainly come into focus when practical problems arise, but theological concepts are first view. The states that tensions experience practice triggers reflection. is coherence call Christians test and dis...

2011
Anne Bruce Rita Schreiber Olga Petrovskaya Patricia Boston

BACKGROUND Existential and spiritual concerns are fundamental issues in palliative care and patients frequently articulate these concerns. The purpose of this study was to understand the process of engaging with existential suffering at the end of life. METHODS A grounded theory approach was used to explore processes in the context of situated interaction and to explore the process of existen...

2004
Georg Gottlob

This talk will report on the results achieved so far in the context of a research programme at the cutting point of logic, formal language theory, and complexity theory. The aim of this research programme is to classify the complexity of evaluating formulas from different prefix classes of second-order logic over different types of finite structures, such as strings, graphs, or arbitrary struct...

Journal: :TheScientificWorldJournal 2008
Vinod D Deshmukh

Self is difficult to define because of its multiple, constitutive streams of functional existence. A more comprehensive and expanded definition of self is proposed. The standard bio-psycho-social model of psyche is expanded to biophysical-mental-social and existential self. The total human experience is better understood and explained by adding the existential component. Existential refers to l...

2015
Antoine Amarilli Michael Benedikt

Query answering under existential rules — implications with existential quantifiers in the head — is known to be decidable when imposing restrictions on the rule bodies such as frontier-guardedness [Baget et al., 2010; 2011a]. Query answering is also decidable for description logics [Baader, 2003], which further allow disjunction and functionality constraints (assert that certain relations are ...

1999
Franz Baader Ralf Küsters

Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the Classic system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. This paper extends the existing work on matching in two directions. On the one...

Journal: :Theor. Comput. Sci. 2011
Koji Nakazawa Makoto Tatsuta Yukiyoshi Kameyama Hiroshi Nakano

This paper shows (1) the undecidability of the type checking and the typability problems in the domain-free lambda calculus with negation, product, and existential types, (2) the undecidability of the typability problem in the domain-free polymorphic lambda calculus, and (3) the undecidability of the type checking and the typability problems in the domain-free lambda calculus with function and ...

1995
Giorgio Levi Francesca Scozzari

We suggest a new formalization of the existential termination problem of logic programs under the PROLOG leftmost selection rule and depth-rst computation rule. First of all, we give a characterization of the problem in terms of occurrence sets, by proving that a hprogram; goali existentially terminates if and only if there exists a nite correct occurrence set. Then we show that in order to stu...

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

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