Abstract. Understanding the collaborations that arise between the instances of classes in object-oriented programs is important for the analysis, optimization, or modification of ...
Stephanie Balzer, Thomas R. Gross, Patrick Eugster
In this paper, we present an application of 0-1 linear programming problem in the indentification of the nondominated paths on a network. To find efficient paths, an adaptationof t...
Gholam Reza Jahanshahloo, F. Hosseinzadeh Lotfi, N...
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...