2206 search results - page 324 / 442 » On the power of coercion abstraction |
189
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
149
click to vote
ITP
2010
15 years 10 months ago
2010
Pitts et al introduced a beautiful theory about names and binding based on the notions of permutation and support. The engineering challenge is to smoothly adapt this theory to a t...
142
click to vote
ESOP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The question of equivalence has long vexed research in concurrency, leading to many different denotational- and bisimulation-based approaches; a breakthrough occurred wit...
184
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
148
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
The K framework, based on rewriting logic semantics, provides a powerful logic for deļ¬ning the semantics of programming languages. While most work in this area has focused on deļ...