Sciweavers

8413 search results - page 58 / 1683
» Ordering Problem Subgoals
Sort
View
DLOG
2003
13 years 9 months ago
DL Reasoner vs. First-Order Prover
We compare the performance of a DL reasoner with a FO prover on reasoning problems encountered during the classification of realistic knowledge bases.
Dmitry Tsarkov, Ian Horrocks
JOC
2000
100views more  JOC 2000»
13 years 7 months ago
Computing Discrete Logarithms in Quadratic Orders
We present efficient algorithms for computing discrete logarithms in the classgroupofaquadraticorderandforprincipalitytestinginarealquadraticorder,based on the work of D
Michael J. Jacobson Jr.
FUIN
2002
109views more  FUIN 2002»
13 years 7 months ago
Another Example of Higher Order Randomness
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability
Verónica Becher, Gregory J. Chaitin
ATAL
2010
Springer
13 years 9 months ago
Infinite order Lorenz dominance for fair multiagent optimization
This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a f...
Boris Golden, Patrice Perny
FOSSACS
2005
Springer
14 years 1 months ago
Third-Order Idealized Algol with Iteration Is Decidable
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗ 3). They are approached via a combination...
Andrzej S. Murawski, Igor Walukiewicz