846 search results - page 1 / 170 » Transforming structures by set interpretations |
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas w...
AGP
2003
IEEE
13 years 10 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
FUIN
2007
13 years 4 months ago
2007
The nets considered here are an extension of Petri nets in two aspects. In the semantical aspect, there is no one firing rule common to all transitions, but every transition is tr...
VMCAI
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper is concerned with one of the basic problems in abstract interpretation, namely, for a given abstraction and a given set of concrete transformers (that express ...
ICAPR
2005
Springer
13 years 10 months ago
2005
Springer
There is need for more formal specification of recognition tasks. Currently, it is common to use labeled training samples to illustrate the task to be performed. The mathematical ...