Algebraic simplification

Article View: comp.lang.prolog

Article #2934

#2934

From: Jan Chomicki
Date: Sat, 16 Jan 1988 18:16

14 lines
1082 bytes

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

Technical Details

Message-ID: <2750@aramis.rutgers.edu>

Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!seismo!sundc!pitstop!sun!amdcad!ames!sdcsvax!rutgers!aramis.rutgers.edu!chomicki

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!seismo!sundc!pitstop!sun!amdcad!ames!sdcsvax!rutgers!aramis.rutgers.edu!chomicki
From: chomicki@aramis.rutgers.edu (Jan Chomicki)
Newsgroups: comp.lang.prolog
Subject: Algebraic simplification
Message-ID: <2750@aramis.rutgers.edu>
Date: 16 Jan 88 18:16:48 GMT
Organization: Rutgers Univ., New Brunswick, N.J.
Lines: 14
Keywords: boolean algebra, normal forms, depth-first search