3535 search results - page 111 / 707 » Logic Program Specialisation |
137
click to vote
LOPSTR
2007
Springer
15 years 9 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
119
click to vote
PEPM
2007
ACM
15 years 9 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
139
click to vote
LPNMR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
117
Voted
CP
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of pr...
136
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Similarity-based Logic Programming (briefly, SLP) has been proposed to enhance the LP paradigm with a kind of approximate reasoning which supports flexible information retrieval a...