Sciweavers

2430 search results - page 300 / 486
» Computing Tutte Polynomials
Sort
View
DLOG
2007
15 years 6 months ago
Partitioning ABoxes Based on Converting DL to Plain Datalog
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
Jianfeng Du, Yi-Dong Shen
FLAIRS
2008
15 years 6 months ago
On the Compilation of Possibilistic Default Theories
Handling exceptions represents one of the most important problems in Artificial Intelligence. Several approaches have been proposed for reasoning on default theories. This paper f...
Salem Benferhat, Safa Yahi, Habiba Drias
WSC
2007
15 years 6 months ago
Implications of heavy tails on simulation-based ordinal optimization
We consider the problem of selecting the best system using simulation-based ordinal optimization. This problem has been studied mostly in the context of light-tailed distributions...
Mark Broadie, Minsup Han, Assaf Zeevi
ATAL
2008
Springer
15 years 5 months ago
Reaction functions for task allocation to cooperative agents
In this paper, we present ARF, our initial effort at solving taskallocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routi...
Xiaoming Zheng, Sven Koenig
CAV
2008
Springer
170views Hardware» more  CAV 2008»
15 years 5 months ago
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations
Abstract. The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interp...
Himanshu Jain, Edmund M. Clarke, Orna Grumberg