584 search results - page 30 / 117 » Logic Programs as term Rewriting Systems |
KI
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning (recursive) programs from incomplete specificati...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
89
Voted
BIRTHDAY
2010
Springer
14 years 7 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
ECAI
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
ENTCS
2006
14 years 9 months ago
2006
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formul...