1686 search results - page 55 / 338 » Programs as polygraphs: computability and complexity |
CG
2002
Springer
14 years 9 months ago
2002
Springer
The difficulty to write successful 19x19 go programs lies not only in the combinatorial complexity of go but also in the complexity of designing a good evaluation function containi...
ACMICEC
2003
ACM
15 years 3 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
JAIR
2007
14 years 9 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
SUM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...