default search action
LILOG: Sorts and Types in Artificial Intelligence 1989
- Karl-Hans Bläsius, Ulrich Hedtstück, Claus-Rainer Rollinger:
Sorts and Types in Artificial Intelligence, Workshop, Eringerfeld, FRG, April 24-26, 1989, Proceedings. Lecture Notes in Computer Science 418, Springer 1989, ISBN 3-540-52337-5
Sorts and Types in Logic, Theorem Proving and Logic Programming
- Arnold Oberschelp:
Order Sorted Predicate Logic. 8-17 - Christoph Walther:
Many-Sorted Inferences in Automated Theorem Proving. 18-48 - Peter H. Schmitt, Wolfgang Wernecke:
Tableau Calculus for Order Sorted Logic. 49-60 - Ulrich Hedtstück, Peter H. Schmitt:
A Calculus for Order-Sorted Predicate Logic with Sort Literals. 61-72 - Christoph Beierle:
Types, Modules and Databases in the Logic Programming Language PROTOS-L. 73-110
Sorte and Types in Knowledge Representation Including Qualitative Reasoning
- Bernhard Nebel, Gert Smolka:
Representation and Reasoning with Attributive Descriptions. 112-139 - Udo Pletat, Kai von Luck:
Knowledge Representation in LILOG. 140-164 - Karl-Hans Bläsius, Claus-Rainer Rollinger, Jörg H. Siekmann:
Structure and Control of the L-LILOG Inference System. 165-182 - Bernd Owsnicki-Klewe:
A General Characterization of Term Description Languages. 183-189 - Werner Dilger, Hans Voß:
Sorts in Qualitative Reasoning. 190-207
Sorts and Types in Natural Language (Understanding) Systems
- Kurt Eberle:
Eventualities in a Natural Language Understanding System. 209-239 - Jürgen Allgayer, Carola Reddig-Siekmann:
What KL-ONE Lookalikes Need to Cope with Natural Language: Scope and Aspect of Plural Noun Phrases. 240-285 - Bernd Mahr, Carla Umbach:
Functor-Argument Structures for the Meaning of Natural Language Sentences and Their Formal Interpretation. 286-304
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.