7868 search results - page 150 / 1574 » Learning by Answer Sets |
129
click to vote
LPNMR
2009
Springer
15 years 11 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
107
click to vote
KIVS
2005
Springer
15 years 10 months ago
2005
Springer
: In modern information systems the dominant retrieval paradigms have shifted from exact matching towards retrieving a list of the most relevant objects. This is because users usua...
161
click to vote
RULEML
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
100
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
The PLATYPUS approach offers a generic platform for distributed answer set solving, accommodating a variety of different architectures for distributing the search for answer sets a...
140
click to vote
AAAI
2004
15 years 6 months ago
2004
In this paper we introduce the language Golog+HTNT I for specifying control using procedural and HTN-based constructs together with deadlines and time restrictions. Our language s...