Abstract. We consider the efficient implementa-tion of the bottom-up evaluation method for recursive queries in logic databases. In the bottom-up evalu-ation algorithms the non-mutually-recursive rules are evaluated in certain order, whereas the evaluation or-der within a set of the mutually

I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available

doi:10.3233/978-1-61499-098-7-103

Prüfungsbehörde vorgelegen. Darmstadt, den 28th February 2014 (Denis Lapiner) This Master’s Thesis proposes and implements a game design for an Android based massively multiplayer online augmented reality game. The proposed game design is based on an analysis of other popular aug-mented reality games

Massively multiplayer online games (MMOGs) have become increasingly popular in the recent years, particularly in the form of online role-playing games (MMORPGs). These games support up to several ten thousand players interacting in a virtual game world. The current commercially successful games

Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con-cepts. This main goal is motivated by the basic fact, constituting also the main problem of KDD, that languages we may choose for knowledge description are incomplete. A fortiori, we have to describe concepts of interest (features, proper-ties, relations etc.) not completely but by means of their reflections (i.e. approx-imations) in the chosen language. The most important issues in this induction process are: – construction of relevant primitive concepts from which approximations of more complex concepts are assembled, – measures of inclusion and similarity (closeness) on concepts, – construction of operations producing complex concepts from the primitive ones.

and backchase

use beneficial shortcuts to identify opportunities or to pursue venture start-up. In other situations, these shortcuts can lead to errors: erroneous evaluations and decisions. Further research will no doubt shed light on the relationship between cognition and (for example) why entrepreneurs attempt

, connected components, triangles, clustering coefficients, and betweenness centrality) on two real-life social graphs, Live-Journal and Last.fm. The optimizations proposed in this paper speed up almost all the algorithms by 3 to 22 times. SociaLite even outperforms typical Java implementations by an average

(Section 2.2) choices. We then detail the GP-based repair strategy (Section 2.3), discussing the genetic operators (Section 2.4), which modify the representation, and the fitness function (Section 2.5), which uses test cases to evaluate the results of the modifications. Finally, a postprocessing step