Jennifer J. Burg

Learn More
This paper describes a tutorial program that serves a double role as an educational tool and a research environment. First, it introduces students to fundamental concepts of propositional logic and gives them practice with theorem proving. Secondly, the program provides an environment in which we can track student learning, explore cognitive issues of human(More)
This paper presents hybrid algorithms for a variation of the Bounded Knapsack Problem which we call the Oregon Trail Knapsack. Our problem entails imposing a cost as well as a weight limit, constraining the values of types of items by means of a variety of value functions, and allowing the value of one item type to be dependent on the presence or absence of(More)
with their students, they must also be able to speak the language of a computernurtured generation. We would argue the best way for a university to accomplish these goals is to place a computer in the hands of every student and faculty member. This article reports on the experience of one university that has realized a campus-wide computer initiative, and(More)
William Faulkner’s non-chronological story telling style has long been a challenge to critics and a puzzle to beginning literature students. “A Rose for Emily,” one of Faulkner’s most frequently anthologized stories, exemplifies the complexity of Faulkner’s treatment of time. In this paper, we apply a constraint-based problem solving method to an analysis(More)
UNLABELLED Cholesteryl ester storage disease (CESD), an inherited deficiency of lysosomal acid lipase (LAL), is an underappreciated cause of progressive liver disease with no approved therapy. Presenting features include dyslipidemia, elevated transaminases, and hepatomegaly. To assess the clinical effects and safety of the recombinant human LAL, sebelipase(More)
Linear constraint solving in constraint logic programming requires in-cremental checks of the satissability of a system of equations and inequalities. Experience has shown that Gauss-Jordan elimination and the simplex method are eecient enough to be of practical value in the implementation of CLP languages based on linear arithmetic constraints 1, 2, 4, 6,(More)
Two dance performances were produced as a collaboration between a modern dance company and university scientists. The performances were thematically based on concepts from mathematics and computer science and used digital imagery, poetry, and real-time computation directed by a MIDI device. The first production played on the Fibonacci sequence and the(More)
CLP(ℜ) is a constraint logic programming language in which constraints can be expressed in the domain of real numbers. Computation in this specialized domain gives access to information useful in intelligent backtracking. In this paper, we present an efficient constraint satisfaction algorithm for linear constraints in the real number domain and show that(More)