Skip to main content
SpringerLink
Log in

Minimal model generation based on E-hyper tableaux

  • Theorem Proving
  • Conference paper
  • First Online:
KI-97: Advances in Artificial Intelligence (KI 1997)

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

Included in the following conference series:

Abstract

Minimal model generation has received great attention as people have deeper and deeper understanding in the semantics of the logic programming, deductive database, non monotonic reasoning and the relationships among them. But most proposed minimal model generation procedures in the literature are inappropriate in the sense that while generating minimal model, they also generate non-minimal models. This means that an explicit minimization has to be employed to obtain minimal models. This may be a great factor of inefficiency. In this paper we develop an approach to generate the minimal models, without explicit minimization process, based on E-hyper tableau which is a variant of hyper tableaux. The soundness and completeness of the procedure is shonw.

Financially supported by Graduate Scholarship of University Koblenz-Landau

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chandrabose Aravindan. An abductive framework for negation in disjunctive logic programming. In J. J. Alferes, L. M. Pereira and E. Orlowska, editors, Proceednigs of Joint European workshop on Logics in AI, Lecture Notes in Artificial Intelligence 1126, pages 252–267, Springer-Verlag, 1996.

    Google Scholar 

  2. Chandrabose Aravindan and Peter Baumgarter. A rational and effecient algorithm for view deletion in database. Technical Report RR-10-97, Fachbericht Informatik, Universität Koblenz-Landa, Germany.

    Google Scholar 

  3. P. Baumgartner and U. Furbach and I. Niemelä,. Hyper Tableaux. In Proc. JELIA 96, number 1129 in LNAI. European Workshop on Logic in AI, Springer, 1996.

    Google Scholar 

  4. P. Baumgartner, Peter Fröhlich, U. Furbach and Wofgang Nejdel. Semantically Guided Theorem Proving for Diagnosis Application. In Proc. of IJCAI'97. IJCAL 1997. To appear.

    Google Scholar 

  5. P. Baumgartner, Peter Fröhlich, U. Furbach and Wofgang Nejdel. Tableaux for Diagnosis Application. In Tableaux '97, LNAI. Springer, 1997. To appear.

    Google Scholar 

  6. S. Brass and J. Dix. A Disjunctive Semantics Based on Bottom-Up Evaluation and Unfolding. Proceedings of the 13th World Computer Congress '94, IFIP, GI-Workshop W2 (Disjunctive Logic Programs and Disjunctive Databases). 1994

    Google Scholar 

  7. Bry, F. and Yahya, A. Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux Proceedings of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods 1996, 143–159. Springer-Verlag.

    Google Scholar 

  8. M.L. Ginsberg. A Circumscriptive Theorem Prover. Artificial intelligence, 39:209–230, 1989.

    Google Scholar 

  9. K. Inoue and M. Koshimura and R. Hasegawa, Embedding Negation as Failure into a Model Generation Theorem Prover. The 11th International Conference on Automated Deduction, 400–415, Sartoga Springs, NY, USA, June 1992, LNAI 607.

    Google Scholar 

  10. J. Minker. On indefinite databases and the closed world assumption. In Lecture Notes in Computer Sciences 138, pages 292-308, Springer-Verlag, 1982.

    Google Scholar 

  11. A. Nerode, R.T. Ng and V.S. Subrahmanina. Computing circumscriptive databases: I. theory and algorithms. Information and Computation, 116:58–80, 1995.

    Google Scholar 

  12. I. Niemelä. A Tableau Calculus for Minimal Model Reasoning. Proceedings of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, 278–294, Springer-Verlag, May 1996.

    Google Scholar 

  13. N. Olivetti. A tableaux and sequent calculus for minimal modelentailment. Journal of Automated Reasoning, 9:99–139, 1992.

    Google Scholar 

  14. T. C. Przymusinski. An Algorithm to Compute Circumscription. Artificial intelligence, 38:49–73, 1989.

    Google Scholar 

  15. T.C. Przymusinski. Static Semantics for Normal and Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence, Special Issue on Disjunctive Programs, 1995.

    Google Scholar 

  16. J. W. Lloyd. Faundations of Logic Programming, Springer-Verlag, second extended edtion, 1987.

    Google Scholar 

  17. A. Yahya, J. A. Fernandez, and J. Minker. Ordered model tree: A normal form for disjunctive deductive databases. J. Automated Reasoning, 13(1):117–144, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Koblenz-Landau, Rheinau 1, D-56075, Koblenz, Germany

    Wenjin Lu

Authors
  1. Wenjin Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerhard Brewka Christopher Habel Bernhard Nebel

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lu, W. (1997). Minimal model generation based on E-hyper tableaux. In: Brewka, G., Habel, C., Nebel, B. (eds) KI-97: Advances in Artificial Intelligence. KI 1997. Lecture Notes in Computer Science, vol 1303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540634932_7

Download citation

  • DOI: https://doi.org/10.1007/3540634932_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63493-5

  • Online ISBN: 978-3-540-69582-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation