395 search results - page 58 / 79 » Decision Problems for Convex Languages |
ACL
2006
13 years 9 months ago
2006
To study PP attachment disambiguation as a benchmark for empirical methods in natural language processing it has often been reduced to a binary decision problem (between verb or n...
EUROPLOP
2006
13 years 9 months ago
2006
Service-centric systems are driven more and more towards self-adaptation in order to satisfy QoS in highly dynamic environments. However, the young age and immaturity of this doma...
FUIN
2007
13 years 7 months ago
2007
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIME-complete. Such ...
CP
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...