Skip to main content

The Logic of Reusable Propositional Output with the Fulfilment Constraint

  • Chapter
Labelled Deduction

Part of the book series: Applied Logic Series ((APLS,volume 17))

Abstract

This paper shows the equivalence of three ways of expressing a certain strong consistency constraint — called the fulfilment constraint — on proofs of the logic of reusable propositional output: as a global requirement on proofs, as a local requirement on labels of formulas, and by phasing of proof rules. More specifically, we first show that the fulfilment constraint may be expressed either as a requirement on the historical structure of the proof tree or as a requirement on the contents of labels attached to its nodes. Second, we show that labelled proofs may be rewritten into a tightly phased form in which rules are applied in a fixed order. Third, we show that when a proof is in such a phased form, the consistency check on labels becomes redundant.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.M. Chisholm. Contrary-to-duty imperatives and deontic logic.Analysis, 24:33–36, 1963.

    Google Scholar 

  2. D. Gabbay. Labelled Deductive Systems, volume 1. Oxford University Press, 1996.

    Google Scholar 

  3. B. Hansson. An analysis of some deontic logics. In R. Hilpinen, editorDeontic Logic: Introductory and Systematic Readings, pages 121–147. D. Reidel Publishing Company, Dordrecht, Holland, 1971. A reprint fromNoûs,1969.

    Google Scholar 

  4. D. Makinson. On a fundamental problem of deontic reasoning. In P. McNamara and H. Prakken, editorsNorms Logics and Information Systems. New Studies on Deontic Logic and Computer Science,pages 29–53. IOS Press, 1999.

    Google Scholar 

  5. D. Makinson and L. Torre. Input-output logics. 1999. Submitted.

    Google Scholar 

  6. Y. Tan and L. Torre. How to combine ordering and minimizing in a deontic logic based on preferences. InDeontic Logic Agency and Normative Systems. Proceedings of the DEON’96,Workshops in Computing, pages 216–232. Springer, 1996.

    Google Scholar 

  7. L. van der Torre.Reasoning about Obligations: Defeasibility in Preference-based Deontic Logic.PhD thesis, Erasmus University Rotterdam, 1997.

    Google Scholar 

  8. L.. Torre. Labeled logics of conditional goals. InProceedings of the Thirteenth European Conference on Artificial Intelligence (ECAI’98), pages 368–369. John Wiley & Sons, 1998.

    Google Scholar 

  9. L.. Torre. Phased labeled logics of conditional goals. InLogics in Artificial Intelligence, LNAI 1489, pages 92–106. Springer, 1998.

    Google Scholar 

  10. L.. Torre. Defeasible goals. InSymbolic and Quantitative Approaches to Reasoning and Uncertainty, LNAI 1638. Springer, 1999.

    Google Scholar 

  11. L. Torre and Y. Tan. The many faces of defeasibility in defeasible deontic logic. In D. Nute, editorDefeasible Deontic Logic, volume 263 ofSynthese Library, pages 79–121. Kluwer, 1997. Extended and revised version of L. van der Torre and Y. Tan, Cancelling and overshadowing: two types of defeasibility in defeasible deontic logic. InProceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI’95),pages 1525–1532. Morgan Kaufman, 1995.

    Google Scholar 

  12. L. Torre and Y. Tan. Diagnosis and decision making in normative reasoning.Artificial Intelligence and Law, 7:51–67, 1999. Revised and extended version of L. van der Torre and Y. Tan. Distinguishing different roles in normative reasoning. InProceedings of the Sixth International Conference on AI and Law (ICAIL’97), pages 225–232. ACM Press, 1997.

    Google Scholar 

  13. L. Torre and Y. Tan. Contrary-to-duty reasoning with preference-based dyadic obligations.Annals of Mathematics and Artificial Intelligence, 2000. To appear. Revised and extended version of L. van der Torre and Y. Tan. Prohairetic Deontic Logic (PDL). InLogics in Artificial Intelligence, LNAI 1489, pages 77–91. Springer, 1998.

    Article  Google Scholar 

  14. L. Torre and E. Weydert. Goals, desires, utilities and preferences. InProceedings of the ECAI’98 Workshop on Decision Theory meets Artificial Intelligence, 1998.

    Google Scholar 

  15. L. Torre and E. Weydert. Parameters for utilitarian desires in a qualitative decision theory.Applied Intelligence, 2000. To appear. Revised and extended version of L. van der Torre and E. Weydert. Parameters for utilitarian desires (extended abstract). InProceedings of the IJCAI’99 Workshop on Practical Reasoning and Rationality (PRR’99), 1999.

    Google Scholar 

  16. G.H. von Wright. A new system of deontic logic. In R. Hilpinen, editorDeontic Logic: Introductory and Systematic Readings, pages 105–120. D. Reidel Publishing Company, Dordrecht, Holland, 1971. A reprint of `A New System of Deontic Logic,’Danish Yearbook of Philosophy1:173182, 1964, and `A Correction to a New System of Deontic Logic’Danish Yearbook of Philosophy2:103–107, 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

van der Torre, L. (2000). The Logic of Reusable Propositional Output with the Fulfilment Constraint. In: Basin, D., D’Agostino, M., Gabbay, D.M., Matthews, S., Viganò, L. (eds) Labelled Deduction. Applied Logic Series, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4040-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-4040-9_10

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-5781-3

  • Online ISBN: 978-94-011-4040-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics