2152 search results - page 218 / 431 » On Automating the Calculus of Relations |
180
click to vote
LICS
2006
IEEE
16 years 15 days ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
156
click to vote
TPHOL
2005
IEEE
16 years 2 days ago
2005
IEEE
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
105
click to vote
ECSQARU
2005
Springer
16 years 21 hour ago
2005
Springer
This paper is centered on the family of Dung’s finite argumentation frameworks when the attacks relation is symmetric (and nonempty and irreflexive). We show that while this fa...
156
click to vote
FROCOS
2005
Springer
16 years 16 hour ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
134
click to vote
LPAR
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We present new careful semantics within Dung’s theory of argumentation. Under such careful semantics, two arguments cannot belong to the same extension whenever one of ...