37 search results - page 7 / 8 » On the computational complexity of assumption-based argument... |
SIGSOFT
2009
ACM
14 years 6 months ago
2009
ACM
A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication. These programs consist of several threa...
SAGT
2010
Springer
13 years 4 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
KI
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
ICALP
2010
Springer
13 years 7 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
LPNMR
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...