Skip to main content
SpringerLink
Log in

Cut and Pay

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce three families of parameterised logics that arise from different ways of controlling the use of cut. We start with a formulation of classical logic in which cut is non-eliminable and then impose restrictions on the use of cut. Three Cut-and-Pay families of logics are presented, and it is shown that each family provides an approximation process for full propositional classical logic when the control over the use of cut is progressively weakened. A sound and complete semantics is given for each component of each of the three families of approximated logics. One of these families is shown to possess the uniform substitution property, a new result for approximated reasoning. A tableau based decision procedure is presented for each element of the approximation families and the complexity of each decision procedure is studied. We show that there are families in which every component logic can be decided polynomially.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Anderson, A.R. and Belnap, N.D. Jr., 1975, Entailment: The Logic of Relevance and Necessity, Vol. 1. Princeton University Press.

  • Boolos, G., 1984, “Don't eliminate cut,” Journal of Philosophical Logic 13, 373–378.

    Article  Google Scholar 

  • Carbone, A. and Semmes, S., 2000, A Graphic Apology for Symmetry and Implicitness, Oxford Mathematical Monographs: Oxford University Press.

    Google Scholar 

  • D'Agostino, M., 1992, “Are tableaux an improvement on truth-tables? – Cut-free proofs and bivalence,” Journal of Logic Language and Information 1, 235–252.

    Article  Google Scholar 

  • D'Agostino, M., 1999, “Tableau methods for classical propositional logic,” pp. 45–124 in Handbook of Tableau Methods, Marcello D'Agostino, Dov Gabbay, Rainer Haehnle, and Joachim Posegga, eds., Kluwer.

  • Dalal, M., 1996a, “Anytime families of tractable propositional reasoners,” pp. 42–45 in International Symposium of Artificial Intelligence and Mathematics AI/MATH-96.

  • Dalal, M., 1996b, “Semantics of an anytime family of reasoners,” pp. 360–364 in 12th European Conference on Artificial Intelligence.

  • da Costa, N.C.A., 1974, “On the theory of inconsistent formal systems,” Notre Dame Journal of Formal Logic 15(4), 497–510.

    Article  Google Scholar 

  • D'Agostino, M. and Mondadori, M., 1994, “The taming of the cut. Classical refutations with analytic cut,” Journal of Logic and Computation 4, 285–319.

    Article  Google Scholar 

  • Finger, M., 2004a, “Polynomial approximations of full propositional logic via limited bivalence,” pp. 526–538 in 9th European Conference on Logics in Artificial Intelligence (JELIA 2004), Vol. 3229 of Lecture Notes in Artificial Intellingence (LNAI), Lisbon, Portugal, Springer.

  • Finger, M., 2004b, “Towards polynomial approximations of full propositional logic,” pp. 11–20 in XVII Brazilian Symposium on Artificial Intelligence (SBIA 2004), Ana L. C. Bazzan and Sofiane Labidi, eds., Vol. 3171 of Lecture Notes in Artificial Intellingence (LNAI), Springer.

  • Finger, M. and Wassermann, R., 2004, “Approximate and limited reasoning: Semantics, proof theory, expressivity and control,” Journal of Logic And Computation 14(2), 179–204.

    Article  Google Scholar 

  • Girard, J.-Y., 1987, “Linear logic,” Theoretical Computer Science 50, 1–102.

    Article  Google Scholar 

  • Massacci, F., 1998, “Anytime approximate modal reasoning,” pp. 274–279 in AAAI-98, Jack Mostow and Charles Rich, eds., AAAIP.

  • Restall, G., 2000, An Introduction to Substructural Logics. Routledge.

  • Schaerf, M. and Cadoli, M., 1995, “Tractable reasoning via approximation,” Artificial Intelligence 74(2), 249–310.

    Article  Google Scholar 

  • Smullyan, R.M., 1968, First-Order Logic, Springer-Verlag.

  • Van Dalen, D., 1984, “Intuitionistic logic,” in Handbook of Philosophical Logic, D. Gabbay and F. Guenthner, eds., Vol. III.

Download references

Author information

Authors and Affiliations

  1. University of Sao Paulo, Sao Paulo, Brazil

    Marcelo Finger

  2. King's College, London, UK

    Dov Gabbay

Authors
  1. Marcelo Finger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dov Gabbay
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcelo Finger.

Additional information

Partly supported by CNPq grant PQ 300597/95-5 and FAPESP project 03/00312-0.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Finger, M., Gabbay, D. Cut and Pay. JoLLI 15, 195–218 (2006). https://doi.org/10.1007/s10849-005-9001-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10849-005-9001-y

Keywords

Search

Navigation