1220 search results - page 32 / 244 » Restricting grammatical complexity |
DAM
2002
13 years 7 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
LICS
1994
IEEE
13 years 11 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
IJCAI
2003
13 years 9 months ago
2003
Motivated by medical terminology applications, we investigate the decidability of the well known expressive DL, SHIQ, extended with role inclusion axioms (RIAs) of the form R ◦ ...
COCO
2000
Springer
13 years 12 months ago
2000
Springer
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
UM
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. The generation of formal poetry involves both complex creativity usually exercised by a human poet - and strict algorithmic restrictions regarding the metrical structure ...