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...

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...

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...

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...

Abstract Considerations of accuracy – the epistemic good having credences close to truth-values have led justification a host norms. These arguments rely on specific ways measuring accuracy. In particular, measure should be strictly proper. However, main argument for strict propriety supports only weak propriety. But follows from given truth directedness (which is non-negotiable) and additivity...