622 search results - page 11 / 125 » Answer Set Programming and Bounded Model Checking |
ICFEM
2007
Springer
14 years 2 months ago
2007
Springer
Bounded semantics of LTL with existential interpretation and that of ECTL (the existential fragment of CTL), and the characterization of these existentially interpreted properties ...
DATE
2008
IEEE
14 years 2 months ago
2008
IEEE
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...
LPNMR
2009
Springer
14 years 16 days ago
2009
Springer
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building ...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we discuss the use of the Answer Set Programming paradigm for representing and analysing specifications of agent-based institutions. We outline the features of insti...
CLIMA
2006
13 years 9 months ago
2006
It is recognised that institutions are potentially powerful means for making agent interactions effective and efficient, but institutions will only really be useful when, as in oth...