Sciweavers

2273 search results - page 19 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
SIGMOD
2003
ACM
105views Database» more  SIGMOD 2003»
14 years 8 months ago
Factorizing Complex Predicates in Queries to Exploit Indexes
Decision-support applications generate queries with complex predicates. We show how the factorization of complex query expressions exposes significant opportunities for exploiting...
Surajit Chaudhuri, Prasanna Ganesan, Sunita Sarawa...
AIPS
2008
13 years 10 months ago
Scheduling Meetings at Trade Events with Complex Preferences
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
Andreas Ernst, Gaurav Singh, René Weiskirch...
DLOG
2003
13 years 9 months ago
Complexity of Reasoning
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
Francesco M. Donini
KR
2004
Springer
14 years 1 months ago
Complex Preferences for Answer Set Optimization
The main contribution of this paper is the definition of the preference description language  ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
Gerhard Brewka
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
14 years 16 days ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas