نتایج جستجو برای: l ukasiewicz connectives

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

Journal: :Inf. Sci. 2013
Davide Ciucci Didier Dubois

Three-valued logics arise in several fields of computer science, both inspired by concrete problems (such as in the management of the null value in databases) and theoretical considerations. Several three-valued logics have been defined. They differ by their choice of basic connectives, hence also from a syntactic and proof-theoretic point of view. Different interpretations of the third truth v...

2004
Liesbeth Degand Nathalie Lefèvre Yves Bestgen

This study focuses on the impact of linguistic markers of coherence on the comprehension of expository discourse. The impact of such markers on comprehension (i.e. off-line) is a highly controversial topic in current studies, especially for connectives for which a facilitating as well as an interfering role has been demonstrated. As a matter of fact, it seems that connectives facilitate the com...

2010
Amal Al-Saif Katja Markert

We present the first effort towards producing an Arabic Discourse Treebank, a news corpus where all discourse connectives are identified and annotated with the discourse relations they convey as well as with the two arguments they relate. We discuss our collection of Arabic discourse connectives as well as principles for identifying and annotating them in context, taking into account properties...

Journal: :Arch. Math. Log. 2010
Philip Kremer

Let L ◦ be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality ◦, understood as ‘next’. We extend the topological semantic for S4 to a semantics for the language L ◦ by interpreting L ◦ in dynamic topological systems, i.e., ordered pairs 〈X, f 〉, where X is a topological space and f is a continuous function on X ...

Journal: :Arch. Math. Log. 2006
Philip Kremer

Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as ‘next’. We extend the topological semantic for S4 to a semantics for the language L by interpreting L in dynamic topological systems, i.e. ordered pairs 〈X, f 〉, where X is a topological space and f is a continuous function on X. Artemov...

Journal: :Language Learning 2022

Many connectives, such as therefore and however, are used very frequently in the written modality. Their acquisition thus represents an important milestone developing language competences. In this article, we assess development of competence with connectives by native French speakers a sentence-level insertion task (N = 307, aged 12 to 64) text-level 172, 13 71). Our results indicate that, desp...

2003
David Toman

In this paper we show that first-order temporal logics form a proper expressiveness hierarchy with respect to dimensionality and quantifier depth of temporal connectives. This result resolves (negatively) the open question concerning the existence of an expressively complete first-order temporal logic, even when allowing multi-dimensional temporal connectives.

2005
Ben Hutchinson

Knowledge of which lexical items convey the same meaning in a given context is important for many Natural Language Processing tasks. This paper concerns the substitutability of discourse connectives in particular. This paper proposes a datadriven method based on a Minimum Description Length (MDL) criterion for automatically learning substitutability of connectives. The method is shown to outper...

Journal: :Theor. Comput. Sci. 2006
Gianluigi Bellin Martin Hyland Edmund Robinson Christian Urban

We investigate semantics for classical proof based on the sequent calculus. We show that the propositional connectives are not quite well-behaved from a traditional categorical perspective, and give a more refined, but necessarily complex, analysis of how connectives may be characterised abstractly. Finally we explain the consequences of insisting on more familiar categorical behaviour.

Applying two definitions of the union of IF-events, P. Grzegorzewski gave two generalizations of the inclusion-exclusion principle for IF-events.In this paper we prove an inclusion-exclusion principle for IF-states based on a method which can also be used to prove Grzegorzewski's inclusion-exclusion principle for probabilities on IF-events.Finally, we give some applications of this principle by...

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

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