622 search results - page 37 / 125 » Answer Set Programming and Bounded Model Checking |
AAAI
2010
13 years 9 months ago
2010
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
DALT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we revisit Logic Programming under the answer-set semantics - or Answer-Set Programming - and its extension Evolving Logic Programming, two languages that u...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
IFIP
2010
Springer
13 years 2 months ago
2010
Springer
Concurrent software is difficult to verify. Because the thread schedule is not controlled by the application, testing may miss defects that occur under specific thread schedules. T...
LPNMR
2011
Springer
12 years 11 months ago
2011
Springer
Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expre...