1144 search results - page 34 / 229 » Logic programming for combinatorial problems |
AAAI
1993
13 years 9 months ago
1993
Automating the construction of semantic grammars is a di cult and interesting problem for machine learning. This paper shows how the semantic-grammar acquisition problem can be vi...
ICALP
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
LPNMR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allow...
AAAI
2000
13 years 9 months ago
2000
Both the Artificial Intelligence (AI) community and the Operations Research (OR) community are interested in developing techniques for solving hard combinatorial problems. OR has ...