dev-lang/qu-prolog-8.2 has been in the tree for over 30 days without bugs. Please stabilize.
Sure, when you only tell us where can we find 'qu-prolog-8.2-xqp-qt4.tar.gz'... http://dev.gentoo.org/~zmedico/infra/distfiles/failure.xml says it fails to fetch.
Sorry about that. I buggered up moving the xqp tarball around. :-( I've uploaded it to distfiles. When it hits the mirrors please retry. Thanks.
is there some simple test to see if it really works?
I guess the simplest test is to run 'qp' and see if you have a Prolog interpreter: $ qp Qu-Prolog Version 8.2 | ?- If you've programmed in Prolog you can test out some generic system predicates. e.g.: | ?- append(Prefix, [c,d|RestOfList], [a,b,c,d,e,f]). Prefix = [a, b] RestOfList = [e, f]<enter> | ?- If you want to test something more substantive then perhaps the easiest way to see a few features of Qu-Prolog is to follow some of the examples in the userguide main.ps (installed with USE="doc"). However a number of examples provided in main.ps assume you've set up appropriate quantifiers and predicates. With all this in mind, a quick way to test that Qu-Prolog at least runs and "does something": 1. emerge qu-prolog with USE="doc examples" 2. from the examples directory run 'qp' to give you a Prolog interpreter. 3. load up some of the example Prolog example files to set up Qu-Prolog use as a theorem prover: | ?- [incomplete_unify]. Warning: force_deref_rev / 2 Singleton Variables: [X] Warning: force_deref_rev / 2 Singleton Variables: [R] Warning: force_identical_subs / 4 Singleton Variables: [S1, S2, Snfi] Warning: force_empty_sub / 3 Singleton Variables: [S] yes | ?- [natural_deduction]. Warning: rule / 3 Singleton Variables: [B] Warning: rule / 3 Singleton Variables: [A] Warning: rule / 3 Singleton Variables: [T] Warning: rule / 3 Singleton Variables: [A] Warning: rule / 3 Singleton Variables: [T] yes | ?- 4. select an example from section 4 ("A simple theorem prover") of main.ps and follow the steps outlined. e.g.: | ?- prove( th3, all x1 ex x2 P(x1,x2) => ex x2 all x1 P(x1,x2)). auto : imp_i 1: all x1 (ex x2 P(x1, x2)) --------------------------------------------------- ex x2 (all x1 P(x1, x2)) :: x1 not_free_in P, x2 not_free_in P, x1 not_free_in x2. 1: all x1 (ex x2 P(x1, x2)) --------------------------------------------------- ex x2 (all x1 P(x1, x2)) :: ex_i. auto : all_i 1: all x1 (ex x2 P(x1, x2)) --------------------------------------------------- P(x0, A) :: all_e(_). auto : ex_e(1) 1: P(B, x3) 2: all x1 (ex x2 P(x1, x2)) --------------------------------------------------- P(x0, A) :: show_constraints. x1 not_free_in [x2] x2 not_free_in [x1] x3 not_free_in [x0] x0 not_free_in [x3] x3 not_free_in B x3 not_free_in A x0 not_free_in A x3 not_free_in P x0 not_free_in P x2 not_free_in P x1 not_free_in P 1: P(B, x3) 2: all x1 (ex x2 P(x1, x2)) --------------------------------------------------- P(x0, A) ::
x86 stable
ppc stable
sparc stable, closing.
