|
Some Programs by members of the Centre:
|
- Diderik Batens, Giete Callaert, Alex Klijn
Logicaprogramma
As this program talks Dutch, so does the rest of this paragraph.
Het programma biedt een groot aantal oefeningen bij bijna alle onderdelen van
Diderik Batens, Logicaboek (Garant, Antwerpen/Apeldoorn)
en ook enkele testen.
In veel gevallen (bijvoorbeeld voor bewijzen) kan men zelf opgaven intikken.
Het programma levert intelligente hulp die de gebruiker helpt de nodige inzichten te verwerven
om de oefenigen onder de knie te krijgen.
Het programma is hier beschikbaar.
U kan login en paswoord aanvragen bij
diderik.batens@ugent.be of
joke.meheus@ugent.be.
- Alex Klijn
Logic à la carte
This programme is a resolution method for a wide variety of logics: the paraconsistent logic
CLuN, the paracomplete logic ClaN, the logic CloN, which is both paraconsistent
and paracomplete. Each of these (rather poor) logics can be extended with combinations of Schütte
properties, thereby driving negation inwards. In this way, the user can flexibly design a logic at
will, either to use it as such or to use it as under limit logic for ACLuN1 or ACLuN2.
The programme can be used in two ways: either to check whether a specific formula is derivable in a
specific logic or to find suitable logical systems. Thus, the programme is meant to be a working tool
for logicians.
Download LaC.zip and
expand it in a separate directory. Four files will be created: LaC.exe,
redituitlegNed.rtf, redituitlegEng.rtf and
Handleiding.doc. In that directory you will find a short manual.
Please read this first!
Comments to: alex.klijn@gmail.com.
- Albrecht Heeffer
Tableaux-based theorem prover for CL and paralogics CLuN, CLaN and CLoN
On-line: http://logica.UGent.be/albrecht/tableaux.html.
- Albrecht Heeffer
Goal-directed theorem prover for CL and paraconsistent logic CLuN
On-line: http://logica.UGent.be/albrecht/dynform.html.
- Diderik Batens
Prospective dynamic proofs
The programme illustrates the prospective dynamics for the propositional versions of
CL (classical logic), for the paraconsistent logic CLuN and for the adaptive logic ACLuN1.
Tasks may be typed in or read from a (up to now rather messy) file.
There are two versions of the program.
The package
pdp1.zip
illustrates the ‘old’ format described in the following papers:
- Diderik Batens and Dagmar Provijn. Pushing the search paths in the proofs. A study in proof heuristics. Logique et Analyse, 173-175:113-134, 2001. Appeared 2003.
- Diderik Batens. On a partial decision method for dynamic proofs. In Hendrik Decker, Jørgen Villadsen, and Toshiharu Waragai, editors, PCL 2002. Paraconsistent Computational Logic, pages 91-108. (= Datalogiske Skrifter vol. 95), 2002. Also available as cs.LO/0207090 at http://arxiv.org/archive/cs/intro.html.
- Diderik Batens. Some computational aspects of inconsistency-adaptive logics. CLE e-Prints, 2(7), 2002. 15 pages. (http://www.cle.unicamp.br/e-prints/articles.html).
The package
pdp2.zip
illustrates the more recent format from the following papers
- Diderik Batens. A formal approach to problem solving. In Claudio Delrieux and Javier Legris, editors, Computer Modeling of Scientic Reasoning, pages 15-26. Universidad Nacional del Sur, Bahia Blanca, Argentina, 2003.
- Diderik Batens. A procedural criterion for final derivability in inconsistency-adaptive logics. Journal of Applied Logic, in print.
Download the desired package, expand the downloaded file in a separate directory. Three
files will be created in either case. Both packages may be expanded in the same
directory (data.txt is a common file). Double-click on
the executable file, pdp1.exe or
pdp2.exe (the other files are called by it).
Several aspects will be improved (some day).
Comments are welcomed at:
Diderik.Batens@UGent.be.
|
