pietro's blog
http://twb.rsise.anu.edu.au/blog/pietro
enTWB for Ocaml 3.10 / camlp5 5.02
http://twb.rsise.anu.edu.au/twb_ocaml_310_camlp5_502
<p>I have ported the TWB to the new version of the ocaml compile. However since the TWB is heavily dependent on the old ocaml pre-processor, I've decided to postpone the re-write of the parser for the new pre-processor relesed with OCaml 3.10 and to use camlp5 instead.</p>
<p>Camlp5 is the old version of OCaml Pre-processor and it is now distributed as stand-alone library.</p>
<p>I've created a second branch of the TWB source code available via darcs .<br />
<a href="http://twb.rsise.anu.edu.au/cgi-bin/darcsweb/darcsweb.cgi" title="http://twb.rsise.anu.edu.au/cgi-bin/darcsweb/darcsweb.cgi">http://twb.rsise.anu.edu.au/cgi-bin/darcsweb/darcsweb.cgi</a></p>
<p><a href="http://twb.rsise.anu.edu.au/twb_ocaml_310_camlp5_502">read more</a></p>Thu, 22 Nov 2007 05:10:38 +1100pietro150 at http://twb.rsise.anu.edu.auSlides for LPAR07
http://twb.rsise.anu.edu.au/slides_lpar07
<p>These are the slides of our presentation at LPAR07</p>
Thu, 25 Oct 2007 03:38:58 +1000pietro147 at http://twb.rsise.anu.edu.auAn On-the-fly Tableau-based Decision Procedure for PDL-Satisfiability
http://twb.rsise.anu.edu.au/fly_tableau_based_decision_procedure_pdl_satisfiability
'''NB''': We are working to make the implementation of this calculus available on this website by the end of the week.
'''UPDATE''':
* pdlMarkedNoSnf.ml : http://twb.rsise.anu.edu.au/propositional_dynamic_logic_no_snf
* pdlMarked.ml: http://twb.rsise.anu.edu.au/propositional_dynamic_logic_snf
alternatively you can also check this out : http://users.rsise.anu.edu.au/~rpg/pdlweb/
paper accepted to m4m http://m4m.loria.fr/M4M5/
==Abstract==
We present a tableau-based algorithm for deciding satisfiability for
propositional dynamic logic (PDL) which builds a finite rooted tree
<p><a href="http://twb.rsise.anu.edu.au/fly_tableau_based_decision_procedure_pdl_satisfiability">read more</a></p>Mon, 24 Sep 2007 09:56:23 +1000pietro126 at http://twb.rsise.anu.edu.auTWB system description
http://twb.rsise.anu.edu.au/twb_system_description_m4m5
paper accepted to m4m http://m4m.loria.fr/M4M5/
==Abstract==
The Tableau Workbench (TWB) is a generic framework for building automated
theorem provers for arbitrary propositional logics. The TWB has a small core
that defines its general architecture, some extra machinery to specify
tableau-based provers and an abstraction language for expressing tableau
rules. This language allows users to ``cut and paste'' tableau rules from
textbooks and to specify a search strategy for applying those rules in a
<p><a href="http://twb.rsise.anu.edu.au/twb_system_description_m4m5">read more</a></p>Mon, 24 Sep 2007 09:50:52 +1000pietro125 at http://twb.rsise.anu.edu.auOne-pass Tableaux for Computation Tree Logic (CTL)
http://twb.rsise.anu.edu.au/one_pass_tableaux_computation_tree_logic_ctl
<p>Paper accepted to LPAR 07 : <a href="http://www.lpar.net/2007/" title="http://www.lpar.net/2007/">http://www.lpar.net/2007/</a></p>
<p>Abstract:</p>
<p><a href="http://twb.rsise.anu.edu.au/one_pass_tableaux_computation_tree_logic_ctl">read more</a></p>Sun, 26 Aug 2007 14:18:12 +1000pietro79 at http://twb.rsise.anu.edu.auAutomata, description logics and other complexity matters
http://twb.rsise.anu.edu.au/automata_description_logics_and_other_complexity_matters
I read a few interesting papers about the relation of modal logic (and in particular fix-point modal logics) with description logics and automata techniques.
== Description Logics: Modal Logics for Class-Based Modeling ==
http://www.dis.uniroma1.it/~degiacom/ftp/00/Degi00aiml.ps.gz
In this paper De Giacomo gives a clear overview regarding the relation of several description logics with well known modal logics.
<p><a href="http://twb.rsise.anu.edu.au/automata_description_logics_and_other_complexity_matters">read more</a></p>Mon, 30 Jul 2007 22:07:50 +1000pietro123 at http://twb.rsise.anu.edu.auMaterial For the TWB Tutorial
http://twb.rsise.anu.edu.au/material_twb_tutorial
* Online Tutorial (still incomplete) : http://twb.rsise.anu.edu.au/tutorial
* Slides from the presentation : http://twb.rsise.anu.edu.au/files/twbtutorial.pdf
* Latest Version of the TWB: (I'm working on it ...)
== Instructions to Compile the TWB ==
===Pre-Requesites ===
To install and run the TWB is essential to have the following software installed on the system
* ocaml compiler version 3.09.2
* findlib
* extlib
1- the ocaml compiler can be downloaded from:
* http://caml.inria.fr/ocaml/index.en.html
<p><a href="http://twb.rsise.anu.edu.au/material_twb_tutorial">read more</a></p>Thu, 05 Jul 2007 02:56:00 +1000pietro121 at http://twb.rsise.anu.edu.auCut-Free Single-pass Tableaux for the Logic of Common Knowledge
http://twb.rsise.anu.edu.au/one_pass_tableaux_computation_tree_logic_ctl_0
<p>We are going to present this paper at a satellite workshop at TABLEAUX 2007 : <a href="http://tableaux2007.univ-cezanne.fr/scientific-program.html" title="http://tableaux2007.univ-cezanne.fr/scientific-program.html">http://tableaux2007.univ-cezanne.fr/scientific-program.html</a></p>
Thu, 14 Jun 2007 20:46:22 +1000pietro113 at http://twb.rsise.anu.edu.auCut-Free Single-pass Tableaux for the Logic of Common Knowledge
http://twb.rsise.anu.edu.au/cut_free_single_pass_tableaux_logic_common_knowledge
<p>paper submitted to AGENTS, LOGIC AND THEOREM PROVING workshop at TABLEAUX 2007</p>
<p><strong>Abstract:</strong></p>
<p>Abstract. We present a cut-free tableau calculus with histories and variables for<br />
the EXPTIME-complete multi-modal logic of common knowledge (LCK). Our<br />
calculus constructs the tableau using only one pass, so proof-search for testing<br />
theoremhood of j does not exhibit the worst-case EXPTIME-behaviour for all j<br />
as in two-pass methods. Our calculus also does not contain a â€œfinitized w-ruleâ€<br />
so that it detects cyclic branches as soon as they arise rather than by worst-case</p>
<p><a href="http://twb.rsise.anu.edu.au/cut_free_single_pass_tableaux_logic_common_knowledge">read more</a></p>Sun, 06 May 2007 22:07:39 +1000pietro85 at http://twb.rsise.anu.edu.ausmall bug in the CTL prover.
http://twb.rsise.anu.edu.au/small_bug_ctl_prover
<p>We just discovered a small bug in the CTL prover in the demo section of the website.<br />
The bug was a trivial problem with the nnf procedure and it's now fixed.</p>
Wed, 25 Apr 2007 18:47:32 +1000pietro83 at http://twb.rsise.anu.edu.au