1941 search results - page 178 / 389 » On the Hardness of Approximate Reasoning |
186
click to vote
ILP
2007
Springer
16 years 20 days ago
2007
Springer
In reinforcement learning problems, an agent has the task of learning a good or optimal strategy from interaction with his environment. At the start of the learning task, the agent...
161
click to vote
TARK
2007
Springer
16 years 19 days ago
2007
Springer
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
164
click to vote
DEXA
2004
Springer
15 years 12 months ago
2004
Springer
Reasoning in legal and social domains appears not to be well dealt with by deductive approaches. This is because such reasoning is open-endedly defeasible, and because the various ...
148
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
204
click to vote
DLOG
2007
15 years 8 months ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...