Counterfactuals, cotenability and consistency

  • A. W. Bollen
Logic And Reasoning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 406)


This paper describes the formal basis for the implementation of counterfactual queries in the experimental CLOGPROG (‘Conditional Logic Programming’) system. In particular, we concentrate on counterfactuals based on a relevant logic, although much of the work is applicable to non-relevant systems. Besides nested conditionals, the language of the system extends PROLOG by allowing negation in assertion positions; this is not negation-as-failure, but a form of inconsistency tolerating ‘DeMorgan’ negation. We show how the counterfactual discussion can be simply extended to provide a means of enforcing consistency with respect to this negation. We sketch the details of the computational model implemented in CLOGPROG; this is an incomplete, but stable and well-behaved approximation to the full theoretical treatment. To focus attention on the special issues of counterfactuals, we restrict ourselves here to the propositional part of the system.


conditionals counterfactuals consistency maintenance logic programming 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AB75]
    A.R. Anderson and N.D. Belnap, Jr. Entailment: the logic of relevance and necessity. Volume 1, Princeton University Press, Princeton, 1975.Google Scholar
  2. [Bat86]
    Diderik Batens. Static and dynamic paraconsistent logics. CC-AI, 3(1–2), 1986.Google Scholar
  3. [Bel76a]
    N. D. Belnap, Jr. How a computer should think. In Contemporary Aspects of Philosophy, Oxford, 1976.Google Scholar
  4. [Bel76b]
    N. D. Belnap, Jr. A useful four valued logic. In G.Epstein and J. M. Dunn, editors, Modern uses of multiple-valued logic, Reidel, 1976.Google Scholar
  5. [Bol85]
    A.W. Bollen. A relevant reasoner. 1985. Research Paper No. 18, Logic Group, Research School of Social Sciences, ANU.Google Scholar
  6. [Bol87]
    A.W. Bollen. A Relevant Extension to PROLOG. Technical Report TR-ARP-15/87, Automated Reasoning Project, Australian National University, 1987.Google Scholar
  7. [Bol88]
    A.W. Bollen. Conditional Logic Programming. PhD thesis, Australian National University, Forthcoming, 1988.Google Scholar
  8. [BS87]
    H. A. Blair and V. S. Subrahmanian. Paraconsistent logic programming. In Springer Lecture Notes in Computer Science 287, Springer-Verlag, 1987.Google Scholar
  9. [Dun86]
    J. M. Dunn. Relevance logic and entailment. In D. Gabbay and F. Guenther, editors, Handbook of Philosophical Logic Vol. III, Reidel, 1986.Google Scholar
  10. [Gin86]
    Matthew L. Ginsberg. Counterfactuals. Artificial Intelligence, (30):35–79, 1986.Google Scholar
  11. [Goo83]
    Nelson Goodman. Fact, Fiction and Forecast. Harvard University Press, 4 edition, 1983.Google Scholar
  12. [GR84]
    D.M. Gabbay and U. Reyle. N-PROLOG: an extension to PROLOG with hypothetical implications. I. Journal of Logic Programming, (4):319–355, 1984.Google Scholar
  13. [Llo84]
    J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • A. W. Bollen
    • 1
  1. 1.Computer Science DepartmentAustralian National UniversityCanberra

Personalised recommendations