Sciweavers

470 search results - page 39 / 94
» Semantic Anchoring with Model Transformations
Sort
View
AGP
2003
IEEE
14 years 1 months ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
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 ...
Thomas Eiter, Axel Polleres
ICMT
2009
Springer
14 years 2 months ago
A Simple Game-Theoretic Approach to Checkonly QVT Relations
Abstract. The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where a two (or more) models ...
Perdita Stevens
DKE
2008
103views more  DKE 2008»
13 years 8 months ago
The XML Tree Model - toward an XML conceptual schema reversed from XML Schema Definition
XML Schema Definition (XSD) is the logical schemas of an XML model, but there is no standard format for the conceptual schema of an XML model. Therefore, we propose an XML Tree Mo...
Joseph Fong, San Kuen Cheung, Herbert Shiu
CONCUR
2004
Springer
14 years 1 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König
AAAI
1990
13 years 9 months ago
The Generalized Theory of Model Preference
In this paper we present a purely semantic view on non-monotonic reasoning. We follow the direction pointed in [16] and claim that any non-monotonic logic can be viewed as a resul...
Piotr Rychlik