4573 search results - page 542 / 915 » Automated Reasoning |
135
click to vote
ICLP
1993
Springer
15 years 9 months ago
1993
Springer
nt an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive...
139
click to vote
ICLP
1993
Springer
15 years 9 months ago
1993
Springer
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
165
click to vote
ALP
1992
Springer
15 years 9 months ago
1992
Springer
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
182
click to vote
ICLP
1994
Springer
15 years 9 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
155
click to vote
CSL
1992
Springer
15 years 9 months ago
1992
Springer
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...