|
H ?
«
‹
←
→
›
»
Language peer sets for SMR: Designed 1994 ↑ 1990s languages ↑ Fifth generation↑ Post-Cold War↑ SMR(ID:2330/smr001)Logic programming languagealternate simple viewDesigned 1994 Published: 1994 In this paper we define a logic programming language, called SMR, whose main computational mechanism is multiset rewriting. It features a guarded choice capability and, above all, a sequential andlike operator. The language is defined starting from a core language, LM, a subset of Andreoli and Pareschi's LO, which is directly derived from linear logic. LM is minimal in a certain sense we will specify. The language SMR admits a translation into LM through a uniform "continuation" mechanism. Concurrency and plan generation in a logic programming language with a sequential operator 1994 appeared in: P. Van Hentenryck, editor, Logic... International Conference on Logic Programming Search in: Google Google scholar World Cat Yahoo Overture DBLP Monash bib NZ IEEE ACM portal CiteSeer CSB ncstrl jstor Bookfinder |