3053 search results - page 196 / 611 » A Logic of Abstract Argumentation |
159
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
167
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
196
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
200
click to vote
FINTAL
2006
15 years 10 months ago
2006
Abstract. Every language employs its own coordination strategies, according to the type of coordinating marking, the pattern of marking, the position of the marker, and the phrase ...
168
Voted
JSYML
1998
15 years 6 months ago
1998
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...