نتایج جستجو برای: expressibility
تعداد نتایج: 389 فیلتر نتایج به سال:
In this paper we describe our progress towards an operational implementation of a modern programming logic. The logic is inspired by the variable type systems of Feferman, and is designed for reasoning about imperative functional programs. The logic goes well beyond traditional programming logics, such as Hoare’s logic and Dynamic logic in its expressibility, yet is less problematic to encode i...
There are several parallel programming models available for numerical computations at different levels of expressibility and ease of use. For the development of new domain specific programming models, a splitting into a distributed data container and parallel data iterators is proposed. Data distribution is implemented in application specific libraries. Data iterators are directly analysed and ...
In virtual organisations, the authorisation and expression of policies in terms of direct trust relationships between providers and consumers have the problems of scalability, flexibility, expressibility, and lack of policy hierarchy because of interdependent institutions and policies [7]. This paper proposes a bilateral negotiation protocol and an English auction to negotiate a list of credent...
Recommended definition of MGD: Meibomian gland dysfunction (MGD) is a chronic, diffuse abnormality of the meibomian glands, commonly characterized by terminal duct obstruction and/or qualitative/quantitative changes in the glandular secretion. This may result in alteration of the tear film, symptoms of eye irritation, clinically apparent inflammation, and ocular surface disease. Previous defini...
We develop a methodology for comparing knowledge representation formalisms in terms of their "representational succinctness," that is, their abi l i ty to express knowledge situations relatively efficiently. We use this framework for comparing many important formalisms for knowledge base representation: propositional logic, default logic, circumscription, and model preference defaults; and, at ...
In this paper, it is proved in general setting that p-admissibilities of control operators and observation operators are invariant to any q-type of perturbations of generator of C0-semigroups on Banach space. Moreover, some relations between theΛ-extensions of observation operators with respect to the original generator and the perturbed generator are also characterized, so that the output can ...
In this paper we present our experience in implementing several irregular problems using a high-level actor language. The problems studied require dynamic computation of object placement and may result in load imbalance as the computation proceeds, thereby requiring dynamic load balancing. The algorithms are expressed as fine-grained computations providing maximal flexibility in adapting the co...
This paper surveys two related lines of research: Logical characterizations of (non-deterministic) linear time complexity classes, and non-expressibility results concerning sublogics of existential second-order logic. Starting from Fagin's fundamental work there has been steady progress in both elds with the eeect that the weakest logics that are used in characterizations of linear time complex...
We have begun a project to automatically create the lexico-syntactic resources for a microplanner as a side-effect of running a domain-specific language understanding system. The resources are parameterized synchronous TAG Derivation Trees. Since the KB is assembled from the information in the texts that these resources are abstracted from, it will decompose along those same lines when used for...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید