590 search results - page 2 / 118 » From Relational Specifications to Logic Programs |
POPL
2006
ACM
14 years 7 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
PKDD
2000
Springer
13 years 11 months ago
2000
Springer
Although there is a growing need for multi-relational data mining solutions in KDD, the use of obvious candidates from the field of Inductive Logic Programming (ILP) has been limit...
ENTCS
2002
13 years 7 months ago
2002
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
LPNMR
1990
Springer
13 years 11 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...