A new declarative semantics for logic languages. In R. Optimizations of bottom-up evaluation with non-ground terms. In Miller 15], pages 557{574. 19 orthogonal to the type of program to which memoing is applied. With some care, they can be used in the context of full Prolog, speciied as we have suggested by a programmer controlled directive. The practicality of the special case of ground, multi...

15] A. Cumani. ESP-A package for the evaluation of stochastic Petri nets with phase-type distributed transitions times. modeling of an automated manufacturing system with deterministic and stochastic Petri nets. net analysis of a replicated le system.mated generation and analysis of Markov reward models using Stochastic Reward Nets. 16 of (000111; 1), which is set to seven. Then, we can solve t...

cost of the overhead is O(lglg n). Hence the implementation cost is O(lg(jA(v)j), which is proportional to the number of comparisons needed by the Koml os algorithm to nd the heaviest edges in 2m half-paths of the tree in the worst case. Summed over all nodes, this comes to O(n log(m+n n)) as Koml os has shown. The only additional costs are in forming the LCA 0 s which take O(m+n) and in proces...

Methods based on machine learning have been proposed with certain advantages for TC (text categorization). However, it is still difficult to further increase the precision and understandability of categorization due to certain aspects of text itself. In this paper, we propose an architecture for TC by addressing domain ontology. Not only more effect and understandability of categorization are a...

A surge of development of new public health surveillance systems designed to provide more timely detection of outbreaks suggests that public health has a new requirement: extreme timeliness of detection. The authors review previous work relevant to measuring timeliness and to defining timeliness requirements. Using signal detection theory and decision theory, the authors identify strategies to ...

A cardinality version of Beigel's nonspeedup theorem. We have shown that the notion of enumeration complexity allows to characterize the query complexity, even in the fault tolerant case. Then we went on to determine for any nite function f : f0; 1g n ! S the extremal values of e(f; A) which can be obtained for some nonrecursive set A. It is open to determine the possible intermediate values. M...

The presented computational model was fully implemented and tested. For validation purposes diierent visualization methods (cf. (Gapp 94)) are used to get an idea of the spatial relations' region of applicability (Figure 4 and 6). The system proceeds from a geometrical scene description and answers questions in natural language about the constellation of the objects involved in a cognitively pl...

21 Like all other papers that have addressed this problem, the mappings generated by this strategy use a heuristic. Experimental evidence has been presented to justify the use of this heuristic, however, one aspect we want to examine further is a bound on the ratio of our mapping algorithm versus the optimal. This examination is useful both for quantifying the worst-case and expected results of...

This study explores the difficulties in physically realizing linguistic instructions concerning the action of jumping. We carried out a questionnaire on the understandability and physical feasibility of various jumping actions in Japanese, and then conducted an experiment in which participants were asked to jump according to these instructions. After the physical performances the participants w...

Hierarchy has widely been recognized as a viable approach to deal with the complexity of conceptual models. For instance, in declarative business process models, hierarchy is realized by sub-processes. While technical implementations of declarative sub-processes exist, their application, semantics, and the resulting impact on understandability are less understood yet—this research gap is addres...