Abstract
The Tableaux Work Bench (TWB) is a meta tableau system designed for logicians with limited programming or automatic reasoning knowledge to experiment with new tableau calculi and new decision procedures. It has a simple interface, a history mechanism for controlling loops or pruning the search space, and modal simplification.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abate, P.: Tableaux work bench (twb) – User Manual (2003), http://arp.anu.edu.au/~abate/twb
Bornat, R., Sufrin, B.: Jape: A calculator for animating proof-on-paper. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 412–415. Springer, Heidelberg (1997)
Chailloux, E., Manoury, P., Pagano, B.: Développement d’applications avec Objective Caml. O’Reilly, Sebastopol (2000)
Fariñas del Cerro, L., Fauthoux, D., Gasquet, O., Herzig, A., Longin, D., Massacci, F.: Lotrec: the generic tableau prover for modal and description logics. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 453–458. Springer, Heidelberg (2001)
Fitting, M.: Proof Methods for Modal and Intuitionistic Logics. Synthese Library, vol. 169, D. Reidel, Dordrecht (1983)
Gabbay, D., Ohlbach, H.J.: Quantifier elimination in second order predicate logic. In: Proc. KR 1992 (1992)
Goré, R.: Tableau methods for modal and temporal logics. In: Handbook of Tableau Methods. ch. 6, pp. 297–396. Kluwer, Dordrecht (1999)
Heuerding, A.: LWBtheory: information about some propositional logics via the WWW. Logic Journal of the IGPL 4(4), 169–174 (1996)
Heuerding, A.: Sequent Calculi for Proof Search in some Modal Logics. PhDthesis, Institute for Applied Mathematics and Computer Science, University of Berne, Switzerland (1998)
Howe, J.M.: Proof Search Issues in Some Non-Classical Logics. PhD thesis, University of St Andrews (December 1998)
Howitt, C.: bloblogic (2002), http://users.ox.ac.uk/~univ0675/blob/
Horrocks, I., Patel-Schneider, P.F.: Optimising propositional modal satisfiability for description logic subsumption. In: Calmet, J., Plaza, J. (eds.) AISC 1998. LNCS (LNAI), vol. 1476, p. 234. Springer, Heidelberg (1998)
Hustadt, U., Schmidt, R.A.: MSPASS: Modal reasoning by translation and first-order resolution. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol. 1847, pp. 67–71. Springer, Heidelberg (2000)
Massacci, F.: Simplification: a general constraint propagation technique for propositional and modal tableaux. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol. 1397, pp. 217–231. Springer, Heidelberg (1998)
Mouri, M.: Theorem provers with counter-models and xpe. Bulletin of the Section of Logic 30(2), 79–86 (2001)
Negri, S., von Plato, J.: Structural Proof Theory. In: CUP (2001)
Paulson, L.C.: A generic tableau prover and its integration with Isabelle. Journal of Universal Computer Science 5(3) (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abate, P., Goré, R. (2003). The Tableaux Work Bench. In: Cialdea Mayer, M., Pirri, F. (eds) Automated Reasoning with Analytic Tableaux and Related Methods . TABLEAUX 2003. Lecture Notes in Computer Science(), vol 2796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45206-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-45206-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40787-4
Online ISBN: 978-3-540-45206-5
eBook Packages: Springer Book Archive