The constraint satisfaction problem (CSP) and its quantified extensions, whether without (QCSP) or with disjunction (QCSP∨), correspond naturally to the model checking problem for three increasingly stronger fragments of positive first-order logic. Their complexity is often studied when parameterised by a fixed model, the so-called template. It is a natural question to ask when two templates ar...

The foundations of a class of logic programming systems wi th the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation method is an extended version of weak model el imination. The first ques­ t ion addressed is how to compute answers with weak model el iminat ion when queries and programs are sets of arbitrary clauses, which is comple...

A broad class of inductive logics that includes the probability calculus is defined by the conditions that the inductive strengths [A|B] are defined fully in terms of deductive relations in preferred partitions and that they are asymptotically stable. Inductive independence is shown to be generic for propositions in such logics; a notion of a scale-free inductive logic is identified; and a limi...

Model transformations are fundamental in model driven development. Thus, verification of model transformations is indispensable to ensure the quality and the reliability of transformation results. In this paper we focus on graph-based model transformation systems using the double-pushout (DPO) approach and study their correctness w.r.t. conformance. It means that, given a transformation system ...

The paper presents the architecture and design of a description logics (DLs) reasoner based on the Model Driven Architecture (MDA) methodology. The architecture relies on OMG's description logics metamodel, tableau metamodel, and model transformations using a language for model transformation. We show an example of DLs knowledge base using UML notation in context of MDA. The idea can be easily ...

A structure M is pregeometric if the algebraic closure is a pregeometry in all M ′ elementarily equivalent to M . We define a generalisation: structures with an existential matroid. The main examples are superstable groups of U-rank a power of ω and d-minimal expansion of fields. Ultraproducts of pregeometric structures expanding a field, while not pregeometric in general, do have an unique exi...

We study a generalization of the fully overdamped Frenkel-Kontorova model in dimension n ≥ 1. This model describes the evolution of the position of each atom in a crystal, and is mathematically given by an infinite system of coupled first order ODEs. We prove that for a suitable rescaling of this model, the solution converges to the solution of a Peierls-Nabarro model, which is a coupled system...

We consider model-based prediction of a finite population total when a monotone transformation of the survey variable makes it appropriate to assume additive, homoscedastic errors. As the transformation to achieve this does not necessarily simultaneously produce an easily parameterized mean function, we assume only that the mean is a smooth function of the auxiliary variable and estimate it non...