2593 search results - page 48 / 519 » constraints 2007 |
132
click to vote
JUCS
2007
15 years 4 months ago
2007
: Most automated reasoning tasks with practical applications can be automatically reformulated into a constraint solving task. A constraint programming platform can thus act as a u...
163
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
150
click to vote
EMNLP
2004
15 years 5 months ago
2004
The morphology of Semitic languages is unique in the sense that the major word-formation mechanism is an inherently non-concatenative process of interdigitation, whereby two morph...
106
click to vote
ACL
1998
15 years 5 months ago
1998
Abstract Resource adaptlvity" Because the sets of strucNatural language parsing is conceived to be a procedure of disambiguation, which successively reduces an initially total...
130
click to vote
IJCAI
1997
15 years 5 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...