Skip to main content

Advertisement

Springer Nature Link
Log in

Closed world assumption for disjunctive reasoning

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

Abstract

In this paper, the relationship between argumentation and closed world reasoning for disjunctive information is studied. In particular, the authors propose a simple and intuitive generalization of the closed world assumption (CWA) for general disjunctive deductive databases (with default negation). This semantics called DCWA, allows a natural argumentation-based interpretation and can beused to represent reasoning for disjunctive information. We compare DCWA with GCWA and prove that DCWA extends Minker’s GCWA to the class of disjunctive databases with default negation. Also we compare our semantics with some related approaches. In addition, the computational complexity of DCWA is investigated.

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
$34.99 /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 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

Explore related subjects

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

References

  1. Reiter R. On the Closed World Databases. InLogic and Data Bases, Gallaire H, Minker J (eds.), Plenum Press, New York, 1978, pp.119–140.

    Google Scholar 

  2. Minker J. On indefinite databases and the closed world assumption. InProc. 6th Conference on Automated Deduction, Loveland D (ed.), New York, LNCS 138, Springer, 1982, pp.292–308.

  3. Wang K. Argumentation-based abduction in disjunctive logic programming.Journal of Logic Programming, 2000, 45(1-3): 105–140.

    Article  MATH  MathSciNet  Google Scholar 

  4. Brass S, Dix J. Semantics of disjunctive logic programs based on partial evaluation.Journal of Logic Programming, 1990, 40(1): 1–46.

    Article  MathSciNet  Google Scholar 

  5. Lobo J, Minker J, Rajasekar A. Foundations of Disjunctive Logic Programming, MIT Press, 1992.

  6. Przymunski T. Static semantics for normal and disjunctive logic programs.Ann. Math. and Artif. Intell., 1995, 14(2-4): 323–357.

    Article  Google Scholar 

  7. Przymunski T. Semantics of disjunctive logic programs and deductive databases. InProceedings of the 2nd International Conference on Deductive and Object-Oriented Databases (DOOD’91), Delobel C, Kifer M, Masunaga Y (eds.), Springer, Germany, 1991, pp.85–107.

    Google Scholar 

  8. Minker J, Zanon G. An extension to linear resolution with selection function.Information Processing Letters, 1982, 14(3): 191–194.

    Article  MATH  MathSciNet  Google Scholar 

  9. Tarski A. A lattice-theoretic fixpoint theorem and its appliations.Pacific J. Math., 1955, 5: 285–309.

    MATH  MathSciNet  Google Scholar 

  10. You J, Yuan L, Gobel R. Abductive logic programming with disjunctive logic programs.Journal of Logic Programming, 2000, 44(1-3): 101–127.

    Article  MATH  MathSciNet  Google Scholar 

  11. Sakama C, Inoue K. Negation in disjunctive logic Programs. InLogic Programming (ICLP’93), Warran D (ed.), Budapest, Hungary, MIT Press, 1993, pp.703–719.

    Google Scholar 

  12. Eiter T, Gottlob G. On the computational cost of disjunctive logic programming: Propositional case.Ann. Math. and Artif. Intell., 1995, 15(3-4): 289–323.

    Article  MATH  MathSciNet  Google Scholar 

  13. Eiter T, Gottlob G. Propositional circumscription and extended closed world reasoning are H P2 -complete.Theoretical Computer Science, 1993, 114(2): 231–245.

    Article  MATH  MathSciNet  Google Scholar 

  14. Gelfond M, Lifschitz V. The stable model semantics for logic programming. InLogic Programming: Proc. the Fifth International Conference and Symposium, Kowalski R, Bowen K (eds.), Seattle, MIT Press, 1988, pp.1070–1080.

    Google Scholar 

  15. Przymuski T. Stable semantics for disjunctive programs.New Generation Computing, 1991, 9(3-4): 401–424.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, 100084, Beijing, P.R. China

    Wang Kewen & Zhou Lizhu

Authors
  1. Wang Kewen
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Zhou Lizhu
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

This work is supported in part by the National Natural Science Foundation of China (No.69883008, No.69773027), and in part by the NKBRSF of China (No.1999032704).

WANG Kewen is an associate professor in the Department of Computer Science, Tsinghua University. His research interests are logic programming, knowledge representation and databases.

ZHOU Lizhu is the head and a professor in the Department of Computer Science, Tsinghua University. His research interests include database systems, Internet data processing, information systems and digital library.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, K., Zhou, L. Closed world assumption for disjunctive reasoning. J. Comput. Sci. & Technol. 16, 381–387 (2001). https://doi.org/10.1007/BF02948986

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords