H ?
«
‹
←
→
›
»
Language peer sets for PROTOS-L:
Germany↑
Germany/1989↑
Designed 1989 ↑
1980s languages ↑
Fifth generation↑
Late Cold War↑
Business Data Processing ↑
Business Data Processing/1989↑
Business Data Processing/de ↑
PROTOS-L(ID:5243/pro084)
alternate simple view
Country: Germany
Designed 1989
Sammet category: Business Data Processing
logic contraint-based database programming
from home page
"PROTOS-L is a logic programming language that integrates a variety of concepts for programming large knowledge based systems. In particular, it has a powerful type concept, a module concept, high-level access to external relational databases, and finite domain constraints. The type concept covers user defined sorts, subsort relationships supporting multiple inheritance and parameterized sorts in the form of polymorphism"
References:
Beierle, Christoph; (1989) Beierle, Christoph; "Types, Modules and Databases in the Logic Programming Language PROTOS-L" IWBS Report 88: (1989)
Beierle, Christoph; Böttcher, Stefan (1989) Beierle, Christoph; Böttcher, Stefan "PROTOS-L: Towards a Knowledge Base Programming Language" Wissensbasierte Systeme 1989: 388-400
Beierle, Christoph; Hedtstück, Ulrich; Pletat, Udo (1989) Beierle, Christoph; Hedtstück, Ulrich; Pletat, Udo; Siekmann, Jörg H. "An Order Sorted Predicate Logic with Closely Coupled Taxonomic Information" IWBS Report 86: 1989
Beierle. (1989) Beierle. C. Types, modules and databases in the logic proramming language PROTOS-L. In Sorts and Types in Artifical Intelligence. Workshop Proceedings, pages 73-110, Eringerfeld West Germany, April 1989.
Böttcher, Stefan; Beierle, Christoph (1989) Böttcher, Stefan; Beierle, Christoph "Database Support for the PROTOS-L System" IWBS Report 71: (1989)
Beierle, Christoph (1991) Beierle, Christoph "An Overview on Planning Applications in PROTOS-L" IWBS Report 163: (1991)
Beierle, Christoph; Böttcher, Stefan; Meyer, Grego (1991) Beierle, Christoph; Böttcher, Stefan; Meyer, Gregor "Draft Report of the Logic Programming Language PROTOS-L" IWBS Report 175: 1991
Beierle, Christoph; Meyer, Gregor; Semle, Heiner (1991) Beierle, Christoph; Meyer, Gregor; Semle, Heiner "A Brief Description of the PROTOS-L System" PDK 1991: 402-404
Beierle, Christoph; (1992) Beierle, Christoph; "Knowledge Based PPS Applications in PROTOS-L" pp80-90
in (1992) Logic Programming Summer School 1992
Beierle, C.; Böttcher, S. (1994) Beierle, C.; Böttcher, S. and Meyer, Gregor Report of the Logic Programming Language PROTOS-L (revised version), 1994
Abstract
in (1992) Logic Programming Summer School 1992
Meyer G. (1994) Meyer G. and C. Beierle. PROTOS-L User's Manual, 1994.
in (1992) Logic Programming Summer School 1992
Resources
-
PROTOS-L home page
-
PROTOS-L: Language Overview PROTOS-L is a language based on logic programming that integrates a variety of concepts for programming large knowledge based systems like a powerful type concept, a module concept, high-level access to external relational databases, and finite domain constraints. The type concept covers user defined sorts, subsort relationships supporting multiple inheritance and parameterized sorts in the form of polymorphism. In addition to relations, also user-defined functions are available. The module concept is similar to that of Modula-2 and allows to hide implementation details from the user of a module. Database access and modification is fully embedded in the programming language PROTOS-L and can be programmed transparent to the user of a program or a program part. Besides simple links to external relations, non-recursive as well as recursive function free deduction rules can be defined. PROTOS-L also provides an easy way to work with windows via an object-oriented interface to the OSF/Motif system. These features as well as file handling, term manipulation etc. are embedded type-safe into PROTOS-L.The implementation of PROTOS-L is based on the PROTOS Abstract Machine, an extension of the Warren Abstract Machine (WAM). In particular, it supports the required polymorphic order- sorted unification. It communicates with a database inference engine realizing a deductive database component, with a window manager realizing the interface to OSF/Motif, and also with the finite domain constraint solver.
Search in:
Google
Google scholar
World Cat
Yahoo
Overture
DBLP
Monash bib
NZ
IEEE
ACM portal
CiteSeer
CSB
ncstrl
jstor
Bookfinder
|