2585 search results - page 377 / 517 » Automating Coherent Logic |
189
click to vote
CADE
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
150
click to vote
ICLP
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Action description languages, such as A and B [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a me...
139
click to vote
LICS
2006
IEEE
16 years 15 days ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
171
click to vote
TIME
2006
IEEE
16 years 15 days ago
2006
IEEE
In this paper we extend the notion of k-anonymity in the context of databases with timestamped information in order to naturally define k-anonymous views of temporal data. We als...
181
click to vote
TIME
2006
IEEE
16 years 15 days ago
2006
IEEE
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...