584 search results - page 32 / 117 » Logic Programs as term Rewriting Systems |
CSUR
1999
14 years 9 months ago
1999
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
109
click to vote
ASP
2003
Springer
15 years 2 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
SOFSEM
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
72
Voted
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
ML
1998
ACM
14 years 9 months ago
1998
ACM
This paper is a case study of a machine aided knowledge discovery process within the general area of drug design. More speci cally, the paper describes a sequence of experiments in...