نتایج جستجو برای: strict topology

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

1996
Tatsunori Mori Hiroshi Nakagawa

This paper proposes a method of the zero pronoun resohition, which is one of the essential processes in understanding systems for Japanese manual sentences. It is based on pragmatic properties of Japanese conditionals. We examined a uumber of sentences appearing in Japanese manuals according to the classillcation based on the types of agent and the types of verb phrase. As ~ result, we obtained...

Journal: :J. Philosophical Logic 2007
Martin Smith

Our understanding of subjunctive conditionals has been greatly enhanced through the use of possible world semantics and, more precisely, by the idea that they involve variably strict quantification over possible worlds. I propose to extend this treatment to ceteris paribus conditionals – that is, conditionals that incorporate a ceteris paribus or ‘other things being equal’ clause. Although such...

2009
Anne Benoit

In this paper, we discuss and compare several policies to place replicas in tree networks subject to server capacity. The client requests are known beforehand, while the number and location of the servers are to be determined. The standard approach in the literature is to enforce that all requests of a client be served by a single server in the tree (Single). One major contribution of this pape...

2001
M. G. Jansen

Abduction is usually defined in terms of classical logical consequence. In this paper we substitute this ’inferential parameter’ by the notion of strict implication. By doing so we hope to put more of the intended meaning of the abductive explanative relation into the background theory. By using strict rather than material implication static domain knowledge for abductive tasks can deal with so...

Journal: :Journal of Functional and Logic Programming 2004
Nicolas Peltier

We present a proof procedure for functional first-order logic programs. The programs we consider allow first-order goals (including disjunctions, conjunctions, negations, and quantifications on elements of the domain). Atoms are either built-in statements or reduction statements of the form t → s, meaning that t is reducible to s. Call-time choices are used and the functions are non-determinist...

2005
Félix Bou Ramon Jansana

Modal languages were originally based on the possible-world approach proposed by Lewis, Carnap and others. In other words, modal languages were originally designed to talk about necessity (the box) and possibility (the diamond). Nowadays, modal languages (and certain natural extensions like dynamic languages, μ-calculus language, . . . ) are viewed as tools for analyzing the properties of Kripk...

Journal: :Journal of Algebra 1993

Journal: :The Journal of Legal Studies 1973

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

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