177 search results - page 34 / 36 » Extending Conceptual Logic Programs with Arbitrary Rules |
POPL
2007
ACM
14 years 6 months ago
2007
ACM
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
TLCA
2009
Springer
14 years 9 days ago
2009
Springer
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
WLP
1997
Springer
13 years 10 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
ECML
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbi...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...