62 search results - page 12 / 13 » Model Transformations in Decidability Proofs for Monadic The... |
POPL
2008
ACM
14 years 6 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
PODS
2010
ACM
13 years 11 months ago
2010
ACM
In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metad...
SODA
2000
ACM
13 years 7 months ago
2000
ACM
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
PKC
2011
Springer
12 years 9 months ago
2011
Springer
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
ECSQARU
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...