47 search results - page 7 / 10 » Solving the Round Robin Problem Using Propositional Logic |
AAMAS
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among...
CADE
2002
Springer
14 years 8 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
INFOCOM
1998
IEEE
14 years 6 days ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
ICLP
2003
Springer
14 years 1 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...