1589 search results - page 28 / 318 » Constraints with Variables' Annotations |
IJCAI
2007
13 years 10 months ago
2007
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...
ECOOP
2006
Springer
14 years 9 days ago
2006
Springer
AspectJ-like languages are currently ineffective at modularizing heterogeneous concerns that are tightly coupled to the source code of the base program, such as logging, invariant...
SEMWEB
2009
Springer
14 years 3 months ago
2009
Springer
This paper explores the application of restricted relationship graphs (RDF) and statistical NLP techniques to improve named entity annotation in challenging Informal English domain...
IJCAI
1989
13 years 9 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
CP
1999
Springer
14 years 28 days ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...