Sciweavers

278 search results - page 23 / 56
» Semantical Correctness and Completeness of Model Transformat...
Sort
View
EMNLP
2008
13 years 9 months ago
A Discriminative Candidate Generator for String Transformations
String transformation, which maps a source string s into its desirable form t , is related to various applications including stemming, lemmatization, and spelling correction. The ...
Naoaki Okazaki, Yoshimasa Tsuruoka, Sophia Ananiad...
ICSE
2009
IEEE-ACM
14 years 7 days ago
A compositional approach to bidirectional model transformation
Bidirectional model transformation plays an important role in maintaining consistency between two models, and has many potential applications in software development, including mo...
Soichiro Hidaka, Zhenjiang Hu, Hiroyuki Kato, Keis...
APN
2005
Springer
14 years 1 months ago
High-Level Nets with Nets and Rules as Tokens
Abstract. High-Level net models following the paradigm “nets as tokens” have been studied already in the literature with several interesting applications. In this paper we prop...
Kathrin Hoffmann, Hartmut Ehrig, Till Mossakowski
JANCL
2008
170views more  JANCL 2008»
13 years 7 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
SEMWEB
2005
Springer
14 years 1 months ago
Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
Herman J. ter Horst