4117 search results - page 43 / 824 » On the Satisfiability of Complex Constraints |
105
click to vote
VLSID
2002
IEEE
16 years 6 days ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
ALT
2001
Springer
15 years 4 months ago
2001
Springer
We develop a theory for learning scenarios where multiple learners co-exist but there are mutual compatibility constraints on their outcomes. This is natural in cognitive learning...
STACS
2000
Springer
15 years 3 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
117
click to vote
ISSRE
2010
IEEE
14 years 10 months ago
2010
IEEE
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
140
click to vote
PODS
1999
ACM
15 years 4 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...