Skip to main content
SpringerLink
Log in

Strong Equivalence for Causal Theories

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2923))

Abstract

Strong equivalence is an important property for nonmonotonic formalisms, allowing safe local changes to a nonmonotonic theory. This paper considers strong equivalence for nonmonotonic causal theories of the kind introduced by McCain and Turner. Causal theories T 1 and T 2 are strongly equivalent if, for every causal theory T, T 1 ∪ T and T 2 ∪ T are equivalent (that is, have the same causal models). The paper introduces a convenient characterization of this property in terms of so-called SE-models, much as was done previously for answer set programs and default theories. A similar result is provided for the nonmonotonic modal logic UCL. The paper also introduces a reduction from the problem of deciding strong equivalence of two causal theories to the problem of deciding equivalence of two sets of propositional formulas.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Akman, V., Erdoğan, S., Lee, J., Lifschitz, V., Turner, H.: Representing the Zoo World and the Traffic World in the language of the Causal Calculator. Artificial Intelligence (2003) (to appear)

    Google Scholar 

  2. Artikis, A., Sergot, M., Pitt, J.: An executable specification of an argumentation protocol. In: Proc. of Artificial Intelligence and Law (ICAIL), pp. 1–11 (2003)

    Google Scholar 

  3. Artikis, A., Sergot, M., Pitt, J.: Specifying electronic societies with the Causal Calculator. In: Giunchiglia, F., Odell, J.J., Weiss, G. (eds.) AOSE 2002. LNCS, vol. 2585, pp. 1–15. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Bochman, A.: A logic for causal reasoning. In: Proc. IJCAI 2003, pp. 141–146 (2003)

    Google Scholar 

  5. Campbell, J., Lifschitz, V.: Reinforcing a claim in commonsense reasoning. In: Logical Formalizations of Commonsense Reasoning: Papers from 2003 AAAI Spring Symposium, pp. 51–56 (2003)

    Google Scholar 

  6. Erdem, E., Lifschitz, V., Wong, M.: Wire routing and satisfiability planning. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 822–836. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Gelfond, M., Lifschitz, V., Przymusińska, H., Truszczyński, M.: Disjunctive defaults. In: Proc. KR 1991, pp. 230–237 (1991)

    Google Scholar 

  8. Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artificial Intelligence (2003) (to appear)

    Google Scholar 

  9. Lee, J., Lifschitz, V.: Describing additive fluents in action language C+. In: Proc. IJCAI 2003, pp. 1079–1084 (2003)

    Google Scholar 

  10. Lifschitz, V.: On the logic of causal explanation. Artificial Intelligence 96, 451–465 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  11. Lifschitz, V.: Missionaries and cannibals in the Causal Calculator. In: Proc. KR 2000, pp. 85–96 (2000)

    Google Scholar 

  12. Lifschitz, V., McCain, N., Remolina, E., Tacchella, A.: Getting to the airport: the oldest planning problem in AI. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 147–165. Kluwer, Dordrecht (2000)

    Google Scholar 

  13. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 526–541 (2001)

    Article  MathSciNet  Google Scholar 

  14. Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25(2-3), 369–390 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lin, F.: Reducing strong equivalence of logic programs to entailment in classical logic. In: Proc. KR 2002, pp. 170–176 (2002)

    Google Scholar 

  16. McCain, N., Turner, H.: A causal theory of ramifications and qualifications. In: Proc. of IJCAI 1995, pp. 1978–1984 (1995)

    Google Scholar 

  17. McCain, N., Turner, H.: Causal theories of action and change. In: Proc. AAAI 1997, pp. 460–465 (1997)

    Google Scholar 

  18. Niemelä, I., Simons, P.: Extending the smodels system with cardinality and weight constraints. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 491–521. Kluwer, Dordrecht (2000)

    Google Scholar 

  19. Pearce, D.: A new logical characterization of stable models and answer sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS, vol. 1216, pp. 57–70. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  20. Pearce, D., Tompits, H., Woltran, S.: Encodings for equilibrium logic and logic programs with nested expressions. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS (LNAI), vol. 2258, pp. 306–320. Springer, Heidelberg (2001)

    Google Scholar 

  21. Reiter, R.: A logic for default reasoning. Artificial Intelligence 13(1,2), 81–132 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  22. Turner, H.: Representing actions in logic programs and default theories: A situation calculus approach. Journal of Logic Programming 31(1-3), 245–298 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  23. Turner, H.: A logic of universal causation. Artificial Intelligence 113, 87–123 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  24. Turner, H.: Strong equivalence for logic programs and default theories (made easy). In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 81–92. Springer, Heidelberg (2001)

    Google Scholar 

  25. Turner, H.: Strong equivalence made easy: Nested expressions and weight constraints. Theory and Practice of Logic Programming 3(4&5), 609–622 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Minnesota, Duluth, Duluth, MN, 55812, USA

    Hudson Turner

Authors
  1. Hudson Turner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Sciences, University of Texas at Austin, USA

    Vladimir Lifschitz

  2. Department of Information and Computer Science, Helsinki University of Technology TKK,  

    Ilkka Niemelä

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Turner, H. (2003). Strong Equivalence for Causal Theories. In: Lifschitz, V., Niemelä, I. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2004. Lecture Notes in Computer Science(), vol 2923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24609-1_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24609-1_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20721-4

  • Online ISBN: 978-3-540-24609-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation