4117 search results - page 170 / 824 » On the Satisfiability of Complex Constraints |
156
click to vote
DLOG
2007
15 years 8 months ago
2007
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
186
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
170
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we consider a cognitive radio (CR) network in which the unlicensed (secondary) users are allowed to concurrently access the spectrum allocated to the licensed (prim...
258
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
181
click to vote
SAT
2005
Springer
16 years 13 hour ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...