Skip to main content
SpringerLink
Log in

An Order-Sorted Resolution with Implicitly Negative Sorts

  • Conference paper
  • First Online:
Logic Programming (ICLP 2001)

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

Included in the following conference series:

Abstract

We usually use natural language vocabulary for sort names in order-sorted logics, and some sort names may contradict other sort names in the sort-hierarchy. These implicit negations, called lexical negations in linguistics, are not explicitly prefixed by the negation connective. In this paper, we propose the notions of structured sorts, sort relations, and the contradiction in the sort-hierarchy. These notions specify the properties of these implicit negations and the classical negation, and thus, we can declare the exclusivity and the totality between two sorts, one of which is affirmative while the other is negative. We regard the negative affix as a strong negation operator, and the negative lexicon as an antonymous sort that is exclusive to its counterpart in the hierarchy. In order to infer from these negations, we integrate a structured sort constraint system into a clausal inference system.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baader, F., & Hanschke, P. (1991). A scheme for integrating concrete domains into concept languages. Pages 452–457 of: Twelfth international conference on artificial intelligence.

    Google Scholar 

  2. Baader, F., & Sattker, U. (1999). Expressive number restrictions in description logics. Journal of logic and computation, 9(3), 319–350.

    Article  MATH  MathSciNet  Google Scholar 

  3. Beierle, C., Hedtsuck, U., Pletat, U., Schmitt, P.H., & Siekmann, J. (1992). An order-sorted logic for knowledge representation systems. Artificial intelligence, 55, 149–191.

    Article  MATH  MathSciNet  Google Scholar 

  4. Cohn, A. G. (1987). A more expressive formulation of many sorted logic. Journal of automated reasoning, 3, 113–200.

    Article  MATH  MathSciNet  Google Scholar 

  5. Cohn, A. G. (1989). Taxonomic reasoning with many sorted logics. Artificial intelligence review, 3, 89–128.

    Google Scholar 

  6. Donini, F. D., Lenzerini, M., Nardi, D., & Schaerf, A. (1996). Reasoning in description logic. Brewka, G. (ed), Principles of knowledge representation. CSLI Publications, FoLLI.

    Google Scholar 

  7. Frisch, Alan M. (1991). The substitutional framework for sorted deduction: fundamental results on hybrid reasoning. Artificial intelligence, 49, 161–198.

    Article  MATH  MathSciNet  Google Scholar 

  8. Gabbay, D., & Hunter, A. (1999). Negation and contradiction. Gabbay, D. M., & Wansing, H. (eds), What is negation? Kluwer Academic Publishers.

    Google Scholar 

  9. Gallier, Jean H. (1986). Logic for computer science. foundations of automatic theorem proving. Harper & Row.

    Google Scholar 

  10. Horrocks, I. (1999). A description logic with transitive and inverse roles and role hierarchies. Journal of logic and computation, 9(3), 385–410.

    Article  MATH  MathSciNet  Google Scholar 

  11. Lobo, J., Minker, J., & Rajasekar, A. (1992). Foundations of disjunctive logic programming. The MIT Press.

    Google Scholar 

  12. Ota, A. (1980). Hitei no imi (in Japanese). Taishukan.

    Google Scholar 

  13. Richards, T. (1989). Clausal form logic. an introduction to the logic of computer reasoning. Addison-Wesley Publishing Company.

    Google Scholar 

  14. Schmidt-Schauss, M. (1989). Computational aspects of an order-sorted logic with term declarations. Springer-Verlag.

    Google Scholar 

  15. Schmidt-Schauss, M., & Smolka, G. (1991). Attributive concept descriptions with complements. Artificial intelligence, 48, 1–26.

    Article  MATH  MathSciNet  Google Scholar 

  16. Smolka, G. (1992). Feature-constraint logics for unification grammars. Journal of logic programming, 12, 51–87.

    Article  MATH  MathSciNet  Google Scholar 

  17. Wagner, G. (1991). Logic programming with strong negation and inexact predicates. Journal of logic computation, 1(6), 835–859.

    Article  MATH  Google Scholar 

  18. Walther, C. (1987). A many-sorted calculus based on resolution and paramodulation. Pitman and Kaufman Publishers.

    Google Scholar 

  19. Weibel, T. (1997). An order-sorted resolution in theory and practice. Theoretical computer science, 185(2), 393–410.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, 101-8430, Tokyo, Japan

    Ken Kaneiwa

  2. Japan Advanced Institute of Science and Technology, 1-1 Asahidai, Tatsunokuchi, 923-1292, Ishikawa, Japan

    Satoshi Tojo

Authors
  1. Ken Kaneiwa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Satoshi Tojo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIP6, case 169, University of Paris 6, 8 rue du Capitaine Scott, 75015, Paris, France

    Philippe Codognet

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaneiwa, K., Tojo, S. (2001). An Order-Sorted Resolution with Implicitly Negative Sorts. In: Codognet, P. (eds) Logic Programming. ICLP 2001. Lecture Notes in Computer Science, vol 2237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45635-X_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-45635-X_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42935-7

  • Online ISBN: 978-3-540-45635-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation