4117 search results - page 91 / 824 » On the Satisfiability of Complex Constraints |
269
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...
167
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Aggregating the judgments of a group of agents regarding a set of interdependent propositions can lead to inconsistent outcomes. One of the parameters involved is the agenda, the ...
180
click to vote
FLAIRS
2008
15 years 8 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
165
click to vote
CADE
2006
Springer
15 years 10 months ago
2006
Springer
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...
161
click to vote
ACTA
2004
15 years 6 months ago
2004
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...