arvind@utcsri.UUCP (Arvind Gupta) (01/06/88)
*** REPLACE THIS LINE WITH YOUR MESSAGE ***
Date: 11 Dec 1987 11:29:38-EST (Friday)
From: Klaus Truemper <KLAUS%UTD.EDU@relay.cs.net>
Subject: Satisfiability Problems in Propositional Logic
I am working on theorem proving in first order logic, and would
like to obtain a set of satisfiability problems of the following
type:
-propositional logic
-clauses in CNF arising from actual decision problems, for example,
from problems of automation, or VLSI design.
-Size: up to several hundred clauses and several hundred literals.
If you can supply one or more such problems, I will be very grateful
if you make them available to me.
Klaus Truemper
Address: TRUEMPER@UTD.EDU