Skip to main content
SpringerLink
Log in

Basic forward chaining construction for logic programs

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1234))

Included in the following conference series:

Research partially supported by NSF grant IRI-9400568.

Research partially supported by ARO contract DAAL03-91-C-0027 and SDIO contract DAAH04-93-C-O113.

Research partially supported by NSP grant DMS-93064270.

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. K. Apt, H.A. Blair, and A. Walker. Towards a theory of declarative knowledge. Foundations of Deductive Databases and Logic Programming, pages 89–142, 1987.

    Google Scholar 

  2. K. Apt. Logic programming. Handbook of Theoretical Computer Science, pages 493–574, 1990.

    Google Scholar 

  3. M. Gelfond and V. Lifschitz. The stable semantics for logic programs. Proceedings of the 5th International Symposium on Logic Programming, pages 1070–1080, 1988.

    Google Scholar 

  4. J. Grant and V.S. Subrahmanian. Reasoning about inconsistent knowledge bases. IEEE Trans. on Knowledge and Data Engineering, to appear.

    Google Scholar 

  5. C.G. Jockusch and R.I. Soare. π 01 classes and degrees of theories. Transactions of American Mathematical Society, 173:33–56, 1972.

    Google Scholar 

  6. M. Kifer and E. Lozinskii. RI: A logic for reasoning about inconsistency. TARK IV, pages 253–262, 1989.

    Google Scholar 

  7. W. Kohn and A. Nerode. Models for Hybrid Systems: Automata, Topologies, Controllability, Observability. In: Hybrid Systems, R.L. Grossman, A. Nerode, A.P. Ravn, H. Rischel, eds. Springer LN in CS 736, pages 317–356, 1993.

    Google Scholar 

  8. W. Marek, A. Nerode, and J.B. Remmel. Nonmonotonic rule systems I. Annals of Mathematics and Artificial Intelligence, 1:241–273, 1990.

    Google Scholar 

  9. W. Marek, A. Nerode, and J. B. Remmel. Nonmonotonic rule systems II. Annals of Mathematics and Artificial Intelligence, 5:229–263, 1992.

    Google Scholar 

  10. W. Marek, A. Nerode, and J. B. Remmel. The stable models of predicate logic programs. Proceedings of International Joint Conference and Symposium on Logic Programming, pages 446–460, Boston, MA, 1992. MIT Press.

    Google Scholar 

  11. W. Marek, A. Nerode, and J. B. Remmel. Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning, Proceedings of 10th Annual IEEE Symposium on Logic in Computer Science, pp. 178–187, 1995.

    Google Scholar 

  12. W. Marek, A. Nerode, and J. B. Remmel. Context for Belief Revision: FC-Normal Nonmonotonic Rule Systems, Annals of Pure and Applied Logic 67(1994) pp. 269–324.

    Google Scholar 

  13. W. Marek and M. Truszczyński. Autoepistemic logic. Journal of the ACM, 38:588–619, 1991.

    Google Scholar 

  14. W. Marek and M. Truszczyński. Nonmonotonic Logic — Context-dependent reasonings 1993, Springer Verlag.

    Google Scholar 

  15. T. Przymusinski, On the declarative semantics of stratified deductive databases and logic programs, Foundations of Deductive Databases and Logic Programming, pages 193–216, 1987.

    Google Scholar 

  16. M. Reinfrank, O. Dressler, and G. Brewka. On the relation between truth maintenance and non-monotonic logics. Proceedings of IJCAI-89, pages 1206–1212.

    Google Scholar 

  17. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.

    Google Scholar 

  18. A. Van Gelder, K.A. Ross and J.S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. Journal of the ACM 38(1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University Kentucky, 40506-0027, Lexington, KY

    V. W. Marek

  2. Mathematical Sciences Institute, Cornell University, 14853, Ithaca, NY

    A. Nerode

  3. Department of Mathematics, University of California at San Diego, 92903, La Jolla, CA

    J. B. Remmel

Authors
  1. V. W. Marek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Nerode
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. B. Remmel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sergei Adian Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marek, V.W., Nerode, A., Remmel, J.B. (1997). Basic forward chaining construction for logic programs. In: Adian, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 1997. Lecture Notes in Computer Science, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63045-7_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-63045-7_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63045-6

  • Online ISBN: 978-3-540-69065-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation