All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 7 Next

Displaying 121 – 140 of 292

Showing per page

Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms

M. Huchard, H. Dicky, H. Leblanc (2010)

RAIRO - Theoretical Informatics and Applications

In the context of object-oriented systems, algorithms for building class hierarchies are currently receiving much attention. We present here a characterization of several global algorithms. A global algorithm is one which starts with only the set of classes (provided with all their properties) and directly builds the hierarchy. The algorithms scrutinized were developped each in a different framework. In this survey, they are explained in a single framework, which takes advantage of a substructure...

Generalized Nets Model of an E-Learning System Software Architecture

Dimov, Aleksandar, Ilieva, Sylvia (2007)

Serdica Journal of Computing

The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshko ff and Lubomir Tschakaloff , Sofi a, July, 2006.Component-based software engineering and software architecture are tightly connected areas in computer science. Software architecture presents the functionality of the system as decomposition into components, the properties of these components and the connectors between them. This paper illustrates a methodology for application...

Generátory lineárních rovnic pro základní školu v prostředí Mathematica 10

Daniel Tyr (2016)

Učitel matematiky

The article focuses on the creation of general tools that will easily generate algebraic equations of several forms. These general tools (i.e., generators of linear equations) may be useful to mathematics teachers for preparing examinations, homework or lesson plans. The principle of generating tasks is based on operations with random integers. The article explains a procedure for creating a generator of linear equations which have integer coefficients and roots. We proceed with a given integer...

Idealized coinductive type systems for imperative object-oriented programs

Davide Ancona, Giovanni Lagorio (2011)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

In recent work we have proposed a novel approach to define idealized type systems for object-oriented languages, based on abstract compilation of programs into Horn formulas which are interpreted w.r.t. the coinductive (that is, the greatest) Herbrand model. In this paper we investigate how this approach can be applied also in the presence of imperative features. This is made possible by considering a natural translation of Static Single Assignment intermediate form programs into Horn formulas,...

Idealized coinductive type systems for imperative object-oriented programs

Davide Ancona, Giovanni Lagorio (2011)

RAIRO - Theoretical Informatics and Applications

In recent work we have proposed a novel approach to define idealized type systems for object-oriented languages, based on abstract compilation of programs into Horn formulas which are interpreted w.r.t. the coinductive (that is, the greatest) Herbrand model. In this paper we investigate how this approach can be applied also in the presence of imperative features. This is made possible by considering a natural translation of Static Single Assignment intermediate form programs into Horn formulas,...

Inf-datalog, modal logic and complexities

Eugénie Foustoucos, Irène Guessarian (2009)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [16]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity...

Inf-datalog, Modal Logic and Complexities

Eugénie Foustoucos, Irène Guessarian (2007)

RAIRO - Theoretical Informatics and Applications

Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [CITE]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity...

Integrating observational and computational features in the specification of state-based, dynamical systems

Corina Cîrstea (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We present an abstract equational framework for the specification of systems having both observational and computational features. Our approach is based on a clear separation between the two categories of features, and uses algebra, respectively coalgebra to formalise them. This yields a coalgebraically-defined notion of observational indistinguishability, as well as an algebraically-defined notion of reachability under computations. The relationship between the computations yielding new system...

Integrating Observational and Computational Features in the Specification of State-Based, Dynamical Systems

Corina Cîrstea (2010)

RAIRO - Theoretical Informatics and Applications

We present an abstract equational framework for the specification of systems having both observational and computational features. Our approach is based on a clear separation between the two categories of features, and uses algebra, respectively coalgebra to formalise them. This yields a coalgebraically-defined notion of observational indistinguishability, as well as an algebraically-defined notion of reachability under computations. The relationship between the computations yielding new system states...

Interactive decision-making in multiobjetive fuzzy programming.

José M. Cadenas, Fernando Jiménez (1994)

Mathware and Soft Computing

We present an interactive decision support system which aids in solving a general multiobjective fuzzy problem, that is, a multiobjective programming problem with fuzzy goals subject to a fuzzy constraint set. The interactive decision support system is proposed. After eliciting the fuzzy goals of the decision maker for each objective function and the fuzzy elements for each constraint, the satisfactory solutions for the decision maker were derived by interactively updating the reference membership...

Currently displaying 121 – 140 of 292