An order-sorted resolution with implicitly negative sorts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2237, Issue , 2001, Pages 300-314

  Kaneiwa, Ken ^a   Tojo, Satoshi ^b  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS;

CONSTRAINT SYSTEMS; INFERENCE SYSTEMS; NATURAL LANGUAGES; ORDER SORTED LOGIC; STRONG NEGATIONS;

LOGIC PROGRAMMING;

EID: 84937203396     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45635-x_28     Document Type: Conference Paper

References (19)

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.
2. Baader, F., & Sattker, U. (1999). Expressive number restrictions in description logics. Journal of logic and computation, 9(3), 319–350.
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.
4. Cohn, A. G. (1987). A more expressive formulation of many sorted logic. Journal of automated reasoning, 3, 113–200.
5. Cohn, A. G. (1989). Taxonomic reasoning with many sorted logics. Artificial intelligence review, 3, 89–128.
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.
7. Frisch, Alan M. (1991). The substitutional framework for sorted deduction: fundamental results on hybrid reasoning. Artificial intelligence, 49, 161–198.
8. Gabbay, D., & Hunter, A. (1999). Negation and contradiction. Gabbay, D. M., & Wansing, H. (eds), What is negation? Kluwer Academic Publishers.
9. Gallier, Jean H. (1986). Logic for computer science. foundations of automatic theorem proving. Harper & Row.
10. Horrocks, I. (1999). A description logic with transitive and inverse roles and role hierarchies. Journal of logic and computation, 9(3), 385–410.
11. Lobo, J., Minker, J., & Rajasekar, A. (1992). Foundations of disjunctive logic programming. The MIT Press.
12. Ota, A. (1980). Hitei no imi (in Japanese). Taishukan.
13. Richards, T. (1989). Clausal form logic. an introduction to the logic of computer reasoning. Addison-Wesley Publishing Company.
14. Schmidt-Schauss, M. (1989). Computational aspects of an order-sorted logic with term declarations. Springer-Verlag.
15. Schmidt-Schauss, M., & Smolka, G. (1991). Attributive concept descriptions with complements. Artificial intelligence, 48, 1–26.
16. Smolka, G. (1992). Feature-constraint logics for unification grammars. Journal of logic programming, 12, 51–87.
17. Wagner, G. (1991). Logic programming with strong negation and inexact predicates. Journal of logic computation, 1(6), 835–859.
18. Walther, C. (1987). A many-sorted calculus based on resolution and paramodulation. Pitman and Kaufman Publishers.
19. Weibel, T. (1997). An order-sorted resolution in theory and practice. Theoretical computer science, 185(2), 393–410.