Characterizations and algorithms of extensions for CADL and QDL | Journal of Computer Science and Technology
Skip to main content
Springer Nature Link
Log in

Characterizations and algorithms of extensions for CADL and QDL

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Recently, Giordano and Martelli (1994) proposed two new cumulative variants of Reiter’s default logic (DL): Commitment to Assumptions Default Logic (CADL) and Quasi-Default Logic (QDL). They have only given quasi-inductive characterizations of extensions for the two variants. In this paper, finite characterizations of extensions for CADL and QDL by applying notions of (joint) compatibility are presented respectively. And corresponding algorithms and complexity results for reasoning are obtained.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Reiter R. A logic for default reasoning.Artif. Intell., 1980, 13: 81–132.

    Article  MATH  MathSciNet  Google Scholar 

  2. Brewka G. Cumulative default logic: in defense of nonmonotonic inference rules.Artif. Intell., 1991, 50: 183–205.

    Article  MATH  MathSciNet  Google Scholar 

  3. Schaub T. On commitment and cumulativity in default logic., InProceedings of European Conference on Symbolic and Quantitative Approaches to Uncertainty, R Kruse (ed.), Berlin: Springer, 1991, pp. 304–309.

    Google Scholar 

  4. Delgrande J, Jackson W. Default logic revised. InProceedings of 2nd International Conference on the Principles of Knowledge Representation and Reasoning, Allen J Fet al. (eds.), Cambridge, MA, 1991, pp. 118–127.

  5. Schaub T. On constrained default logic. InProc. ECAI-92, Vienna, Austria, 1992, pp.304–308.

  6. Giordano L, Martelli A. On cumulative default logic.Artif. Intell., 1994, 66: 167–179.

    Article  MathSciNet  Google Scholar 

  7. Zhang Mingyl. A new research into default logic.Information and Computation, 1996, 129(2): 73–85.

    Article  MATH  MathSciNet  Google Scholar 

  8. Gottlob G, Zhang Mingyi. Cumulative default logic Finite characterization, algorithms and complexity.Artif. Intell., 1994, 69: 329–345.

    Article  MATH  MathSciNet  Google Scholar 

  9. Zhang Mingyi. Some results on default logic.J. of Comput. Sci. & Technol., 1994, 9(3): 267–274.

    Article  MATH  Google Scholar 

  10. Zhang Mingyi. A Characterization of extensions of general default theories. InProceedings of Canadian Artificial Intelligence Conference, Glasgow J, Hadely B (eds.), Morgan Kaufmann, San Mateo, CA, 1992, pp. 134–139.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Guizhou Academy of Sciences, 550001, Guiyang, P.R. China

    Zhang Mingyi

  2. Department of Computer Science, Guizhou University, 550025, Guiyang, P.R. China

    Zhang Ying

Authors
  1. Zhang Mingyi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhang Ying
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by the National Hi-Tech Research and Development Program of China and NNSFC.

ZHANG Mingyi was born in 1943. He graduated from Guizhou University in 1965, where he is now a Professor.

ZHANG Ying was born in 1969. He received the Bachelor degree frome Guizhou University in 1993. His current research focuses on applied mathematics and computer science and technology.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, M., Zhang, Y. Characterizations and algorithms of extensions for CADL and QDL. J. Comput. Sci. & Technol. 14, 140–145 (1999). https://doi.org/10.1007/BF02946520

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946520

Keywords

Search

Navigation