2722 search results - page 372 / 545 » Automating Language Evolution |
122
click to vote
ICLP
1999
Springer
15 years 8 months ago
1999
Springer
Concurrency in Logic Programming has received much attention in the past. One problem with many proposals, when applied to Prolog, is that they involve large modifications to the...
132
click to vote
LOPSTR
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. A concept of annotations for rendering procedural aspects of Prolog is presented, built around wellknown procedural concepts of Standard Prolog. Annotations describe prop...
136
click to vote
LPAR
1999
Springer
15 years 8 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
116
click to vote
ILP
1998
Springer
15 years 8 months ago
1998
Springer
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
LICS
1997
IEEE
15 years 8 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...