%============================================================================== % Project: SLP - An Interpreter for Super Logic Programs / Static Semantics % Module: test7.txt % Purpose: Another test for finding non-minimal conditional facts. % Last Change:13.10.2001 % Language: SLP % Author: Stefan Brass % Email: Stefan.Brass@informatik.uni-giessen.de, sbrass@sis.pitt.edu % Address: Universitaet Giessen, Arndtstr. 2, 35392 Giessen, Germany % Copyright: (c) 2001 by Stefan Brass % Licence: Distributed under the conditions of the GNU Public Licence. %============================================================================== p | q. p :- not q. p | r | q. p :- not q, not r. p :- not(p & q). % The following conditional facts should be listed: % p | q. % p :- not q. % p :- not(p & q). % The residual program is the same (no reductions possible): % p | q. % p :- not q. % p :- not(p & q). $v.