874 search results - page 14 / 175 » Computing Weighted Solutions in Answer Set Programming |
JAIR
2012
12 years 25 days ago
2012
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
DALT
2009
Springer
14 years 5 months ago
2009
Springer
In this paper, we investigate the multiagent planning problem in the presence of cooperative actions and agents, which have their own goals and are willing to cooperate. To this en...
ASP
2001
Springer
14 years 2 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
AMAI
2006
Springer
13 years 10 months ago
2006
Springer
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
AAAI
2004
13 years 11 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...