Skip to main content
SpringerLink
Log in

What is a Horn clause in partial logic?

  • Invited Papers
  • Conference paper
  • First Online:
Logics in AI (JELIA 1990)

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

Included in the following conference series:

  • 138 Accesses

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. C. C. Chang and H. J. Keisler. Model Theory. Third Edition. North-Holland 1990.

    Google Scholar 

  2. J. M. Dunn. Intuitive Semantics for First-Degree Entailments and ‘Coupled Trees.’ Philosophical Studies 29 (1976) pp. 149–168.

    Google Scholar 

  3. S. Feferman. Towards Useful Type-Free Theories. I. Journal of Symbolic Logic 49 (1984) pp. 75–111.

    Google Scholar 

  4. J. E. Fenstad, T. Langholm and E. Vestre. Representations and Interpretations. COSMOS Report No. 9. Department of Mathematics, University of Oslo 1989.

    Google Scholar 

  5. P. C. Gilmore. The Consistency of Partial Set Theory without Extensionality. In Axiomatic Set Theory, Proceedings of Symposia in Pure Mathematics 13, II. American Mathematical Society, Providence, R. I. 1974.

    Google Scholar 

  6. T. Langholm. Partiality, Truth and Persistence. CSLI Lecture Notes No. 15. University of Chicago Press 1988.

    Google Scholar 

  7. B. Mahr and J. A. Makowsky. Characterizing specification languages which admit initial semantics, Proceedings, 8th. CAAP, Springer Lecture Notes in Computer Science 159 (1983) pp. 300–316.

    Google Scholar 

  8. J. A. Makowsky. Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples, Journal of Computer and System Sciences 34 (1987) pp. 266–292.

    Google Scholar 

  9. J. C. C. Mc Kinsey. The decision problem for some classes of sentences without quantifiers, Journal of Symbolic Logic 8 (1943) pp. 61–76.

    Google Scholar 

  10. P. H. Schmitt. Computational aspects of three-valued logic, Proceedings, 8th. International Conference on Automated Deduction, Springer Lecture Notes in Computer Science 230 (1986) pp. 190–198.

    Google Scholar 

  11. J. C. Shepherdson. Negation in Logic Programming. In: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann Publishers 1988.

    Google Scholar 

  12. A. Tarski. Some notions and methods on the borderline of algebra and meta-mathematics, Proceedings, International Congress of Mathematicians, Cambridge, Mass. 1950, 1. American Mathematical Society, Providence, R. I. 1952.

    Google Scholar 

  13. E. Vestre. Representasjon av Direkte Spørsmål. Masters Thesis, University of Oslo 1987.

    Google Scholar 

  14. E. Vestre and J. E. Fenstad. Representing Direct Questions. COSMOS Report No. 4. Department of Mathematics, University of Oslo 1989.

    Google Scholar 

  15. H. Volger. On Theories which Admit Initial Structures. FNS-Bericht 85-1. Universität Tübingen, Forschungsstelle für natürlich-sprachliche Systeme 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Informatics, University of Bergen, Norway

    Tore Langholm

Authors
  1. Tore Langholm
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Eijck

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Langholm, T. (1991). What is a Horn clause in partial logic?. In: van Eijck, J. (eds) Logics in AI. JELIA 1990. Lecture Notes in Computer Science, vol 478. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018434

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46982-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation