47 search results - page 5 / 10 » Preorder Relations |
CAI
2005
Springer
14 years 10 months ago
2005
Springer
The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e.,...
FOIKS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Argumentation is a reasoning model based on the construction and the evaluation of arguments. In his seminal paper, Dung has proe most abstract argumentation framework. I...
ENTCS
2008
14 years 10 months ago
2008
Dcpos can be presented by a preorder of generators and inequational relations expressed as covers. Algebraic operations on the generators (possibly with their results being ideals...
DLT
2003
14 years 11 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
EDBT
2008
ACM
15 years 10 months ago
2008
ACM
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...