140 search results - page 7 / 28 » Orderings and Constraints: Theory and Practice of Proving Te... |
108
click to vote
ICLP
1997
Springer
15 years 3 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
103
Voted
AISC
2008
Springer
15 years 1 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
96
Voted
ICDE
2007
IEEE
15 years 6 months ago
2007
IEEE
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
115
Voted
CSCLP
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
TLCA
2005
Springer
15 years 5 months ago
2005
Springer
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...