نتایج جستجو برای: abstract operator
تعداد نتایج: 489866 فیلتر نتایج به سال:
In database theory, the term database transformation was used to refer to a unifying treatment for computable queries and updates. Recently, it was shown that non-deterministic database transformations can be captured exactly by a variant of ASMs, the so-called Database Abstract State Machines (DB-ASMs). In this article we present a logic for DBASMs, extending the logic of Nanchen and Stärk for...
SyntaxClass(ProcessPlan partial owl#Thingrestriction(hasOperation minCardinality(1)))UsageDomain ofhasOperation, name, processPlanID Class: ProducerA specialized resource entity that is responsible for the execution of producingoperations, such as a welding robot or a CNC (Computer Numerical Control) machine.•owl:Thing•Resource•ProducerSuper Classes<l...
The original proof used the dual cell decomposition of the triangulation of X . As algebraic topology developed in the course of the century, it became possible to extend the Poincaré duality theorem to non-triangulable topological manifolds, and also to homology manifolds. In 1961, Browder [Br1] proved that a finiteH-space satisfies Poincaré duality. This result led him to question whether or ...
Data Types in C++ | Lesson 01 | Sets | Page 1 It is a common programming need to keep track of a collection of things. In this case, we do not need to keep track of the order of the collection, but rather what is contained in the collection. Consider, for example, a collector of baseball cards. The collector cares less about the order in which the cards were acquired, rather only what has been ...
The paper considers the strong bisimilarity/similarity checking problems for CCS and CCS, two typical variants of CCS. The strong bisimilarity of the CCS/CCS processes is shown to be Π 1 -complete, even when the processes are restricted to the restriction prenex normal forms. The strong bisimilarity between a CCS/CCS process and a fixed regular process is also shown to be Π 1 -complete. The pap...
In [8], P. Hájek and V. Švejdar determined normal forms for the system ILF, and showed that we can eliminate the modal operator ¤ from IL–formulas. The normal form for the closed fragment of the interpretability logic IL is an open problem (see [13]). We prove that in some cases we can eliminate the modal operator ¤. We give an example where it is impossible to eliminate ¤. AMS subject classifi...
insert() abstract delete() abstract lookup() abstract forall() HashSet ... ListSet ... Set impl insert() delete() lookup() forall() deleteAll() union() constructor() changeImpl() SetImpl abstract insert() abstract delete() abstract lookup() abstract forall() abstract changeImpl() constructor (type subtypeSetImpl) { impl = new type ; }insert() abstract delete() abstract lookup() abstract forall(...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید