🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: comp.lang.prolog
Article #1535

Graph Traversal

#1535
From: Arindam Das
Date: Fri, 02 Oct 1992 22:31
26 lines
1216 bytes
Hi !

I am implementing an automated mask layout generator for dynamic CMOS
circuits.

In the first part of my implementation, i am building a two-level logic
synthesizer in prolog. The input to the synthesizer is
the on-set and don't-care-set of minterms for multi-output
functions and the output is a set of connectivity
informations and a minimized switching graph 
which is an interconnection of transistors realizing 
the given functions. 

Now, In my program i need to do complex traversal of the graph.
I being at ease in using Prolog (Quintus Prolog), am using it
comfortably and i am finding that i can develop the code pretty
quickly.

However I have to defend the use of Quintus Prolog instead of C.

Could somebody in the net give me some advice and tips and points
for defending the use of declarative prolog instead of imperative C ?

thanx in advance

-arindam
Technical Details
Message-ID: <1605@newsserver.cs.uwindsor.ca>
Path: arc1-ca.pugleaf.net!sparky!uunet!utcsri!torn!newsserver.cs.uwindsor.ca!arindam

Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!utcsri!torn!newsserver.cs.uwindsor.ca!arindam
From: arindam@cs.uwindsor.ca (Arindam Das)
Newsgroups: comp.lang.prolog
Subject: Graph Traversal
Keywords: Prolog, Graph
Message-ID: <1605@newsserver.cs.uwindsor.ca>
Date: 2 Oct 1992 22:31:50 GMT
Sender: news@server.uwindsor.ca
Lines: 27