Sciweavers

472 search results - page 3 / 95
» Limiting Negations in Formulas
Sort
View
FLAIRS
2007
13 years 8 months ago
Handling Qualitative Preferences Using Normal Form Functions
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
Salem Benferhat, Daniel Le Berre, Karima Sedki
VALUETOOLS
2006
ACM
162views Hardware» more  VALUETOOLS 2006»
13 years 11 months ago
Fast solvers for queueing systems with negative customers
In this paper, we are interested in solving Markovian queueing systems having Poisson batch arrivals, exponential servers and negative customers. Preconditioned conjugate gradient...
You-Wei Wen, Wai-Ki Ching, Michael K. Ng
ACL
1990
13 years 7 months ago
Expressing Disjunctive and Negative Feature Constraints with Classical First-Order Logic
In contrast to the "designer logic" approach, this paper shows how the attribute-value feature structures of unification grammar and constraints on them can be axiomatiz...
Mark Johnson
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 6 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
DEXA
2010
Springer
157views Database» more  DEXA 2010»
13 years 6 months ago
Containment of Conjunctive Queries with Negation: Algorithms and Experiments
We consider the containment problem for conjunctive queries with atomic negation. Firstly, we refine an existing algorithm based on homomorphism checks, which itself improves other...
Khalil Ben Mohamed, Michel Leclère, Marie-L...