We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
Victor W. Marek, Inna Pivkina, Miroslaw Truszczyns...
We study the problem of finding small weak -nets in three dimensions and provide new upper and lower bounds on the value of for which a weak -net of a given small constant size e...
Abstract. We consider three paradigms of computation where the bene ts of a parallel solution are greater than usual. Paradigm 1 works on a time-varying input data set, whose size ...
This paper compares three specification-based testing criteria using Mathur and Wong's PROBSUBSUMES measure. The three criteria are specification-mutation coverage, full pred...
Aynur Abdurazik, Paul Ammann, Wei Ding 0003, A. Je...
This paper uses a constraint set approach to linear programming problems with equality constraints whose coefficients and/or right-hand side values could be uncertain. We consider ...