Acceptable Programs Revisited

SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED

Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...

The Bratko-Kopec Test Revisited

The twenty-four positions of the Bratko-Kopec test (Kopec and Bratko, 1982) represent one of several attempts to quantify the playing strength of chess computers and human subjects. Although one may disagree with the choice of test set, question its adequacy and completeness, and so on, the fact remains that the designers of computer chess programs still do not have an acceptable means of estim...

Sampler Programs: The Stable Model Semantics of Abstract Constraint Programs Revisited

CONSTRAINT PROGRAMS REVISITED

Unification-free Prolog programs revisited

What's in a Trace: The Box Model Revisited

In this paper we investigate trace protocols of PROLOG programs. We present a precise mathematical speciication of the box model for deenite programs as it was informally introduced by Byrd. We also give a sketch of how to generalize this speciication to normal logic programs.