7123 search results - page 174 / 1425 » The Ordered Set of Rough Sets |
190
click to vote
FOIKS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
149
click to vote
COLING
2000
15 years 7 months ago
2000
We define state transition grammars (STG) as an intermediate tbrmalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy ...
170
click to vote
DIMACS
1996
15 years 7 months ago
1996
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
179
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehen...
173
click to vote
FOSSACS
2012
Springer
14 years 2 months ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...