chomicki@aramis.rutgers.edu (Jan Chomicki) (01/17/88)
Does anybody have or can anyone point me to a reasonable Prolog program for algebraic simplification? I'm particularly interested in going between Disjunctive and Conjunctive normal forms of boolean formulas. I'm NOT interested in standard textbook solutions to these problems, because they do not translate into practical programs. It seems to me that heuristics for both path termination and pattern selection for replacement have to be used. On a more general note, is Prolog good for symbolic computation? -- Jan Chomicki (chomicki@aramis.rutgers.edu) Phone: (201) 932-3999 Dept.of Computer Science, Rutgers University, New Brunswick, NJ 08903