37 search results - page 8 / 8 » A New Meta-complexity Theorem for Bottom-Up Logic Programs |
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
PEPM
2010
ACM
13 years 6 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...