937 search results - page 9 / 188 » On the Complexity of Partial Order Properties |
CIE
2008
Springer
14 years 10 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
PVLDB
2010
14 years 4 months ago
2010
Although there has been a considerable body of work on skyline evaluation in multidimensional data with totally ordered attribute domains, there are only a few methods that consid...
102
click to vote
AAAI
2008
15 years 9 days ago
2008
Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alterna...
183
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
The vast majority of work on skyline queries considers totally ordered domains, whereas in many applications some attributes are partially ordered, as for instance, domains of set ...