Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

[Caml-list] [ANN] RegSTAB released

2 views
Skip to first unread message

Vincent Aravantinos

unread,
Jul 6, 2009, 4:50:06 AM7/6/09
to Gurus Ocaml
Dear list,
I am pleased to announce the first release of RegSTAB.

RegSTAB is a SAT-solver able to deal with formula schemas:
you can give it a scheme of formulas such as "/\i=1..n P_i -> P_i
+1" (where n is a variable)
and it will be able to answer you if *all the formulas of this form
(i.e. for every value of n) are unsatisfiable*.
i.e. it can treat at once an infinite set of propositional formulas.

Link: http://forge.ocamlcore.org/projects/regstab/

RegSTAB is based on a recent paper:
http://membres-liglab.imag.fr/aravantinos/Publis/tableaux2009/tab09.pdf

Cheers,
--
Vincent Aravantinos
PhD Student - LIG - CAPP Team
Grenoble, France
+33.6.11.23.34.72
vincent.a...@imag.fr
http://membres-lig.imag.fr/aravantinos/

vincent aravantinos

unread,
Jul 6, 2009, 5:34:18 AM7/6/09
to caml...@inria.fr

[Sorry for multiple post]

Dear list,
I am pleased to announce the first release of RegSTAB.

RegSTAB is a SAT-solver able to deal with formula schemas:

you can give it a scheme of formulas such as "/\i=1..n P_i -> P_i+1" (where n is a variable)


and it will be able to answer you if *all the formulas of this form (i.e. for every value of n) are unsatisfiable*.
i.e. it can treat at once an infinite set of propositional formulas.

Link: http://forge.ocamlcore.org/projects/regstab/
Manual: manual

Cheers,
--
Vincent Aravantinos
PhD Student - LIG - CAPP Team
Grenoble, France
+33.6.11.23.34.72
vincent.a...@imag.fr
http://membres-lig.imag.fr/aravantinos/

_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

0 new messages