804 search results - page 6 / 161 » On the Termination of the Chase Algorithm |
103
click to vote
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract--This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and...
108
Voted
WFLP
2009
Springer
15 years 4 months ago
2009
Springer
CORR
2006
Springer
14 years 10 months ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
CADE
1992
Springer
15 years 2 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
TACAS
2009
Springer
15 years 4 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...