4 search results - page 1 / 1 » A Decidable Class of Groundable Formulas in the General Theo... |
KR
2010
Springer
13 years 9 months ago
2010
Springer
We present a decidable class of first-order formulas in the general theory of stable models that can be instantiated even in the presence of function constants. The notion of an ...
JAIR
2012
11 years 7 months 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...
IFM
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
DBPL
1997
Springer
13 years 9 months ago
1997
Springer
We consider spatial databases that can be defined in terms of polynomial inequalities, and we are interested in monotonic transformations of spatial databases. We investigate a hi...