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)
f educators are to communicate effectively with their students, they must also be able to speak the language of a computer-nurtured 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(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)
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)
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)
"Digital media" is one of those unfortunate terms that means different things in different contexts. This difficulty of definition -- along with its association with art, communication, architecture, and film -- puts digital media on the margins of traditional computer science curricula. This paper reviews the types of digital media programs current in(More)
This paper presents a method for intelligent backtracking in CLP(<). Our method integrates a depth-rst intelligent backtracking algorithm developed for logic programming with an original constraint satisfaction algorithm which naturally generates sets of connicting constraints. We prove that if CLP(<) is assumed to cover strictly the domain of real numbers,(More)