Computer and information sciences topic list of research papers

Swingup and Stabilization of the Rotational Inverted Pendulum Using PD and FuzzyPD Controllers
Abstract The paper proposes a simplified solution of the control problem of the rotational inverted pendulum. The rotational inverted pendulum (RIP) is a complex system, widely studied in many areas due to its complexity and nonlinearities. The...
2014 / StelianEmilian Oltean 
Comparative analysis of the expressiveness of shared dataspace coordination1 1Work partially supported by Italian Ministry of University  MURST 40%  Progetto TOSCA.
Abstract We study the expressiveness of the most prominent representatives of the family of shared dataspace coordination languages, namely Linda, Gamma and Concurrent Constraint Programming. The investigation is carried out by...
2004 / A. Brogi, N. Busi, M. Gabbrielli, Gianluigi Zavattaro 
Reflection and Strategies in Rewriting Logic1 1Supported by Office of Naval Research Contracts N0001495C0225 and N0001496C0114, National Science Foundation Grant CCR9224005, and by the Information Technology Promotion Agency, Japan, as a part of the Industrial Science and Technology Frontier Program “New Models for Software Architecture” sponsored by NEDO (New Energy and Industrial Technology Development Organization).
Abstract After giving general metalogical axioms characterizing reflection in general logics in terms of the notion of a universal theory, this paper specifies a finitely presented universal theory for rewriting logic and gives a detailed proof of...
2004 / Manuel Clavel, José Mes eguer 
SmartTools
Abstract SmartTools is a development environment generator that provides a structure editor and semantic tools as main features. The wellknown visitor pattern technique is commonly used for designing semantic analysis, it has been automated and...
2004 / Isabelle Attali, Carine Courbis, Pascal Degenne, Alexandre Fau, Didier Parigot, et al. 
States of Knowledge
Abstract When a group of people are thinking about some true formula A, one of them may know it, all of them may know it, or it might be common knowledge. But there are also many other possible states of knowledge and they can change when...
2004 / Rohit Parikh 
A Practical, Globally Optimal Algorithm for Geometric Matching under Uncertainty
Abstract Geometric matching under uncertainty is a longstanding problem in computer vision. This paper presents a simple and efficient branchandbound algorithm for finding globally optimal solutions to geometric matching problems under a wide...
2004 / Thomas M. Breuel 
Transforming equality logic to propositional logic
Abstract We investigate and compare various ways of transforming equality formulas to propositional formulas, in order to be able to solve satisfiability in equality logic by means of satisfiability in propositional logic. We propose equality...
2004 / Hans Zantema, Jan Friso Groote 
A Powerdomain of Possibility Measures
Abstract We provide a domaintheoretic framework for possibility theory by studying possibility measures on the lattice of opens &#38;#x1D4AA;(X) of a topological space X. The powerspaces P[0,∞] (X) and P[0,1] (X) of all such maps extend to...
2005 / Michael Huth 
The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations
Abstract Many metalanguages and logical frameworks have emerged in recent years that use the terms of the lambda calculus as data structures. A common set of questions govern the suitability of a representation for lambda terms in the implementation ...
2004 / Gopalan Nadathur 
Exploiting Visual Languages Generation and UML Meta Modeling to Construct MetaCASE Workbenches
Abstract In the paper we propose an approach for the construction of metaCASE workbenches. The approach is based on the technology of visual language generation systems and on UML meta modeling. Visual modeling environments are generated starting...
2004 / G. Costagliola, V. Deufemia, F. Ferrucci, C. Gravino 
Böhm's Theorem for Berarducci Trees1 1This paper was made possible thanks to the hospitality ETL offered in the March 1999 to both Mariangiola Dezani and Paula Severi.
Abstract We propose an extension of lambda calculus which internally discriminates two lambda terms if and only if they have different Berarducci trees.
2005 / Mariangiola DezaniCiancaglini, Paula Severi, FerJan de Vries 
Termination and normalisation under strategy Proofs in ELAN
Abstract In this paper, we review several methods for proving termination of rewrite programs or answer questions about normal forms. We concentrate on the methods that have been designed in ELAN and which are useful for studying termination and...
2005 / Hélène Kirchner, Isabelle Gnaedig 
Preface
Abstract Foreword This volume contains the Proceedings of the Second International Workshop on RuleBased Programming (RULE2001). The Workshop was held in Firenze, Italy on September 4, 2001, as satellite event to PLI2001. ...
2005 / Mark van den Brand, Rakesh Verma 
A Performance Study of Distributed Timed Automata Reachability Analysis
Abstract We experimentally evaluate an existing distributed reachability algorithm for timed automata on a Linux Beowulf cluster. It is discovered that the algorithm suffers from load balancing problems and a high communication overhead. The load...
2005 / Gerd Behrmann 
Dynamic choice under ambiguity2011 / Marciano Siniscalchi

Software Tool for Planning and Analyzing Engineering Changes in Manufacturing Systems
Abstract Companies are facing an increasing number of engineering changes (ECs) in manufacturing systems (MS). The planning of ECs becomes a continuous task. It has to be proceeded properly in order to identify the efforts of the implementation and...
2013 / R.C. Malak, J.C. Aurich 
Specification of RealTime Systems in UML
Abstract We introduce time semantics into UML class and statechart diagrams. This extends the expressiveness of UML for specification of realtime systems and allows to specify verification properties of realtime systems by means of Timed...
2005 / E.E. Roubtsova, J. van Katwijk, W.J. Toetenel, C. Pronk, R.C.M. de Rooij 
CallbyNeed Reduction for Membership Conditional Term Rewriting Systems
Abstract This paper proves that, for a normal membership conditional term rewriting system (MCTRS), (1) a reducible term has a needed redex if the MCTRS is nonoverlapping, and (2) whether a redex is nvneeded is decidable. ...
2005 / Mizuhito Ogawa 
Tutorial and Simulation Electrooptic and Acoustooptic Software as Innovative Methodology to Improve the Quality of Electronic and Computer Engineering Formation2006 / P. MartinezJimenez, M. VaroMartinez, G. PedrosPerez, M.D.C. GarciaMartinez, M.D.S. ClimentBellido, et al.

Declarative Debugging of Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC20012705C0301, by Accóon Integrada HispanoItaliana HI20000161 and by Generalitat Valenciana under grant GV01424.
Abstract We present a general framework for the declarative debugging of functional logic programs, which is valid both for eager as well as lazy programs. We associate to our programs a semantics based on a (continuous) immediate consequence...
2004 / M. Alpuente, F.J. Correa, M. Falaschi