191 search results - page 2 / 39 » Mappings Between Domain Models in Answer Set Programming |
IJCAI
2007
13 years 6 months ago
2007
We first provide a mapping from Pearce’s equilibrium logic and Ferraris’s general logic programs to Lin and Shoham’s logic of knowledge and justified assumptions, a nonmon...
ASP
2001
Springer
13 years 9 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...
ATAL
2010
Springer
13 years 4 months ago
2010
Springer
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
IJDMB
2011
12 years 8 months ago
2011
: Recently, many approaches to model regulatory networks have been proposed in the systems biology domain, however the task is far from being solved. In this paper we propose an an...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...