1743 search results - page 73 / 349 » Generalized Modal Satisfiability |
127
Voted
DLOG
2008
15 years 3 months ago
2008
We have shown recently that, in extensions of ALC that involve inverse roles, conjunctive query answering is harder than satisfiability: it is 2-ExpTime-complete in general and NEx...
80
Voted
CADE
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Formulas are often monotonic in the sense that if the formula is satisfiable for given domains of discourse, it is also satisfiable for all larger domains. Monotonicity i...
133
click to vote
COMBINATORICS
2006
15 years 21 days ago
2006
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
72
Voted
SIGIR
2009
ACM
15 years 7 months ago
2009
ACM
Query abandonment by search engine users is generally considered to be a negative signal. In this paper, we explore the concept of good abandonment. We define a good abandonment ...
130
click to vote
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choic...