نتایج جستجو برای: declar

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

Journal: :Int. J. Cooperative Inf. Syst. 1994
Anne H. H. Ngu Robert Meersman Hans Weigand

The speci cation of communication behavior is fundamental in devel oping interoperable transactions In particular the temporal ordering of messages exchanged between di erent communicating agents must be declar atively speci ed and veri ed in order to guarantee consistency of data in the various component systems This paper shows that by expressing communi cation constraints in propositional te...

1995
Michele Bugliesi Hasan M. Jamil

We present a model for deductive object oriented query lan guages with inheritance and overriding In this model we consider a DAG like dynamic isa hierarchy and we account for both value or attribute in heritance and method inheritance or code sharing We show that these two types of inheritance can be treated uniformly within an elegant declar ative setting We then propose a novel semantics for...

1992
Pascal Van Hentenryck Vijay Saraswat Yves Deville

Constraint logic programming languages such as CHIP have demonstrated the practicality of declar ative languages supporting consistency techniques and nondeterminism Nevertheless they su er from the black box e ect the programmer must work with a monolithic unmodi able inextensible constraint solver This problem can be overcome within the logically and computationally richer concurrent constrai...

1996
Eric Monfroy Christophe Ringeissen

Constraint Logic Programming (CLP) is a class of programming languages inheriting declar-ativity from logic programming and eeciency from constraint solving. The CLP scheme enables to design applications by declaring relations (the constraints) between high-level objects. However , constraints are restricted to formulae handled by solvers. Thus, the declarativity may be jeopardized due to the s...

1994
Andreas Abecker Holger Wache

We informally introduce TaxLog, a close integration of logic programming and terminological reasoning. Terminological systems are handling declarative logic-based descriptions of conceptual knowledge. Most of them restrict their expressiveness and focus on (eecient) reasoning algorithms for certain services. This imposes principal restrictions on the expressivity of such a formalism. To get max...

Journal: :journal of studies in learning and teaching english 0
behzad nasirpour shiraz azad university

memory is not a single entity. it is a gift of mother nature, the ability of living organisms to retain and to utilize acquired knowl- edge. memory is precisely related to learning, in that memory in biolog- ical systems entails learning and that learning implies retention of such information. memory can be divided into multifaceted systems. the renaissance of encephalon compatible learning app...

Journal: :CoRR 2014
Xuhui Li Mengchi Liu Shanfeng Zhu Arif Ghafoor

Various query languages have been proposed to extract and restructure infor-mation in XML documents. These languages, usually claiming to be declar-ative, mainly consider the conjunctive relationships among data elements.In order to present the operations where the hierarchical and the disjunc-tive relationships need to be considered, such as restructuring hierarchy andhandl...

2012

Facebook = {facebook, social, network, websit, launch, februari, 2004, oper, privat, own, facebook, juli, 2010, facebook, 500, million, activ, user, person, fourteen, world, user, creat, person, pro l, add, user, friend, exchang, messag, includ, automat, notif, updat, pro l, addition, user, join, common, interest, user, group, organ, workplace, school, colleg, characterist, servic, stem, colloq...

1997
Sven Eric Panitz Manfred Schmidt-Schauß

reduction e e0 if e!# e0 Approximation C[e] C[Ti] j e Ti is a new variable. Argument saturation e e Ti where Ti is a new variable. If e is a HNF where the head is a supercombinator Branching C[caseA T1 e1 : : : em] fT1 7! (cA;1 T1;1 : : : T1;n1)gC[e1 T1;1 : : : T1;n1 ] j : : : j fT1 7! (cA;m Tm;1 : : : Tm;nm)gC[em Tm;1 : : : Tm;nm ] Where Ti;j are new variables, m is the number of constructors ...

2000
Luca Bompani Paolo Ciancarini Fabio Vitali

H yper text functionalities r epr es ent a for m of the distilled wisdom of the hyper m edia comm unity. G iven the peculiar natur e of the W or ld W ide W eb, it is very difficult to s ucces s fully propos e functionalities that becom e widely accepted. XM LC is a pr ototype of an XML br ows er that, given its m odular ar chitectur e and gener al s cope, can be pr oposed as the bas is for im p...

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

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