The Completeness of Logic Programming with Sort Predicates

Systems and Computers in Japan

Volumn 35, Issue 1, 2004, Pages 37-46

  Kaneiwa, Ken ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Knowledge base system; Logic programming; Order sorted logic; Sort predicate

Indexed keywords

INFORMATION RETRIEVAL; KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING; SEMANTICS;

KNOWLEDGE REPRESENTATION LANGUAGES; ORDER SORTED LOGIC; SORT PREDICATE;

KNOWLEDGE REPRESENTATION;

EID: 0346686136     PISSN: 08821666     EISSN: None     Source Type: Journal    
DOI: 10.1002/scj.10409     Document Type: Article

References (20)

1. Aït-Kaci H, Nasr R. LOGIN: A logic programming language with built-in inheritance. Journal of Logic Programming, p 185-215, 1986.
2. Aït-Kaci H, Podelski A. Towards a meaning of LIFE. Journal of Logic Programming, p 195-234, 1993.
3. Beierle C, Hedtsuck U, Pletät U, Schmitt PH, Siekmann J. An order-sorted logic for knowledge representation systems. Artificial Intelligence 1992;55:149-191.
4. Cohn AG. Taxonomic reasoning with many sorted logics. Artificial Intelligence Review 1989;3:89-128.
5. Doets K. From logic to logic programming. MIT Press; 1994.
6. Frisch AM. A general framework for sorted deduction: Fundamental results on hybrid reasoning. Proc First Int Conference on Principles of Knowledge Representation and Reasoning, 1989.
7. Hanus M. Logic programming with type specifications. In: Pfenning F (editor). Types in logic programming. MIT Press; 1992.
8. Herbrand J. In: Goldfarb WD (editor). Logical writings. Harvard University Press; 1971.
9. Hill PM, Topor RW. A semantics for typed logic programs. In: Pfenning F (editor). Types in logic programming. MIT Press; 1992.
10. Kakuta T, Haragachi M, Okubo Y. A goal-dependent abstraction for legal reasoning by analogy. International Journal of Artificial Intelligence and Law 1997;5:97-118.
11. Kaneiwa K, Tojo S. Event, property, and hierarchy in order-sorted logic. Proc 1999 Int Conf on Logic Programming. MIT Press; 1999. p 94-108.
12. Kaneiwa K, Tojo S. An order-sorted resolution with implicitly negative sorts. Proc 2001 Int Conf on Logic Programming. Springer-Verlag; 2001. LNCS 2237, p 300-314.
13. Kifer M, Lausen G, Wu J. Logical foundations of object-oriented and frame-based languages. J ACM 1995;42:741-843.
14. Lloyd JW. Foundations of logic programming. Springer-Verlag; 1987.
15. Oberschelp A. Untersuchungen zur mehrsortigen quantorelogik. Mathematische Annalen 1962;145:297-333.
16. Schmidt-Schauss M. Computational aspects of an order-sorted logic with term declarations. Springer-Verlag; 1989.
17. Shepherdson JC. The role of standardising apart in logic programming. Theoretical Computer Science 1994;129:143-166.
18. Walther C. A many-sorted calculus based on resolution and paramodulation. Pitman and Kaufman; 1987.
19. Walther C. Many-sorted unification. Journal of the Association for Computing Machinery 1988;35:1.
20. Weibel T. An order-sorted resolution in theory and practice. Theoretical Computer Science 1997;185: 393-410.