This paper presents an approach to produce generalization candidates for a concept hierarchy without the necessity of being an expert in the domain to be generalized and ...
A General Game Playing System is one that can accept a formal description of a game and play the game effectively without human intervention. Unlike specialized game players, such...
Michael R. Genesereth, Nathaniel Love, Barney Pell
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...