590 search results - page 30 / 118 » From Relational Specifications to Logic Programs |
114
click to vote
PEPM
2007
ACM
15 years 9 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
123
click to vote
ICLP
1993
Springer
15 years 7 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...
122
click to vote
TACS
2001
Springer
15 years 7 months ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
152
click to vote
META
1992
15 years 7 months ago
1992
A meta-level extension of a logic programming language is presented. The resulting language, called 'LOG (read quote-log), provides meta-programming facilities similar to thos...
117
click to vote
ILP
2000
Springer
15 years 6 months ago
2000
Springer
First-order probabilistic models are recognized as efficient frameworks to represent several realworld problems: they combine the expressive power of first-order logic, which serv...