Summary form only given. this research focuses on the problem of the semantic linking and co-evolution of the different design diagrams and models of an object-oriented software application. the blueprint of an object...
详细信息
ISBN:
(纸本)9780769517360
Summary form only given. this research focuses on the problem of the semantic linking and co-evolution of the different design diagrams and models of an object-oriented software application. the blueprint of an object-oriented software application consists mainly of models drawn in a modeling language. the state-of-the-art modeling language in object-oriented software development is the Unified Modeling Language (UML). Our research hypothesis is that using decidable fragments of first order logic to express the different UML diagrams enables the semantic linking of the different diagrams and models and enables the support of co-evolution which can be semi-automated, enhancing the reusability, maintainability and understandability of the design of the software application and of the software application in general. We propose to develop a formal framework to support the linking of the different diagrams and models within the software development life cycle (SDLC). the advantages of such a framework are: reasoning capabilities are provided, co-evolution is more guaranteed, adaptability of the design is improved and reuse and understandability of the software design increases. To support co-evolution of the design models in a semi-automatic way we investigate the query capabilities of these logic families.
Prolog is one of the best-known logicprogramming languages and suitable for implementing an inference engine for agents. However, Prolog does not take into account the dynamic nature of agents such as knowledge acqui...
详细信息
In this paper is described how computer supported cooperative work can be used to enhance project development memory, focusing on software development. the collaboration model that is presented is based upon the conce...
详细信息
In this paper is described how computer supported cooperative work can be used to enhance project development memory, focusing on software development. the collaboration model that is presented is based upon the concepts of communication, coordination and cooperation. Each of these concepts is analyzed regarding software specification. the paper presents some examples of systems that seek to capture and refine group ideas through the process of argumentation. the paper also shows how the building of project memory can facilitate the recovery of the context and the reasoningthat led to the taking of project decisions.
Satisfiability of complex word-level formulas often arises as a problem informal verification of hardware designs described at the register transfer level (RTL). Even though most designs are described in a hardware de...
详细信息
ISBN:
(纸本)0769514413
Satisfiability of complex word-level formulas often arises as a problem informal verification of hardware designs described at the register transfer level (RTL). Even though most designs are described in a hardware description language (HDL), like Verilog or VHDL, usually this problem is solved in the Boolean domain, using Boolean solvers, these engines often show a poor performance for data path verification. Instead of solving the problem at the bit-level, a method is proposed to transform conjunctions of bitvector equalities and inequalities into sets of integer linear arithmetic constraints. It is shown that it is possible to correctly model the modulo semantics of HDL operators as linear constraints. Integer linear constraint solvers are used as a decision procedure for bitvector arithmetic. In the implementation we focus on verification of arithmetic properties of Verilog-HDL designs. Experimental results show considerable performance advantages over high-end Boolean SAT solver approaches. the speed-up on the benchmarks studied is several orders of magnitude.
Multiple selections, though heavily used in file managers and drawing editors, are virtually nonexistent in text editing. this paper describes how multiple selections can automate repetitive text editing. Selection gu...
详细信息
ISBN:
(纸本)9781581134599
Multiple selections, though heavily used in file managers and drawing editors, are virtually nonexistent in text editing. this paper describes how multiple selections can automate repetitive text editing. Selection guessing infers a multiple selection from positive and negative examples provided by the user. the multiple selection can then be used for inserting, deleting, copying, pasting, or other editing commands. Simultaneous editing uses two levels of inference, first inferring a group of records to be edited, then inferring multiple selections with exactly one selection in each record. Both techniques have been evaluated by user studies and shown to be fast and usable for novices. Simultaneous editing required only 1.26 examples per selection in the user study, approaching the ideal of 1-example PBD. Multiple selections bring many benefits, including better user feedback, fast, accurate inference, novel forms of intelligent assistance, and the ability to override system inferences with manual corrections.
the proceedings contain 41 papers. the special focus in this conference is on Machine Learning, automatedreasoning, Knowledge Representation and Multi-agent Systems. the topics include: A Monte Carlo approach to hard...
ISBN:
(纸本)3540426019
the proceedings contain 41 papers. the special focus in this conference is on Machine Learning, automatedreasoning, Knowledge Representation and Multi-agent Systems. the topics include: A Monte Carlo approach to hard relational learning problems;evaluation methods for focused crawling;a knowledge-based neurocomputing approach to extract refined linguistic rules from data;RBF networks exploiting supervised data in the adaptation of hidden neuron parameters;an automatic accompanist based on hidden Markov models;learning logic models for automated text categorization;user profiling in an application of electronic commerce;an analysis of backjumping and trivial truth in quantified Boolean formulas satisfiability;abduction with penalization in logicprogramming;product design as product revise;supporting product configuration in a virtual store;reasoning about dynamic scenes using autonomous agents;tuning the collaboration level with autonomous agents;reasoning about actions in a multiagent domain;an interactive system for generating arguments in deceptive communication;an agent based approach to virtual market place simulation;user-adapted image descriptions from annotated knowledge sources;wide coverage incremental parsing by learning attachment preferences;a hybrid approach to optimize feature selection process in text classification;symbolic and conceptual representation of dynamic scenes;a non-traditional omnidirectional vision system with stereo capabilities for autonomous robots;a constraint-based architecture for flexible support to activity scheduling;planning and execution in dynamic environments and an agent architecture for planning in a dynamic environment.
We have developed a genetic logicprogramming system (GeLog) which implements a combination of two different approaches for automatic programming: inductive logicprogramming and genetic algorithm. the paper presents ...
详细信息
ISBN:
(纸本)3540427325
We have developed a genetic logicprogramming system (GeLog) which implements a combination of two different approaches for automatic programming: inductive logicprogramming and genetic algorithm. the paper presents the system and discusses its performance on a benchmark problem(1).
When Prolog programs that manipulate lists to manage a collection of resources are rewritten to take advantage of the linear logic resource management provided by the logicprogramming language Lolli, they can obtain ...
详细信息
the proceedings contain 84 papers. the special focus in this conference is on Principles and Practice of Constraint programming. the topics include: Hybrid benders decomposition algorithms in constraint logic programm...
ISBN:
(纸本)3540428631
the proceedings contain 84 papers. the special focus in this conference is on Principles and Practice of Constraint programming. the topics include: Hybrid benders decomposition algorithms in constraint logicprogramming;a hybrid framework integrating mixed integer programming and constraint logicprogramming;towards stochastic constraint programming;global cut framework for removing symmetries;capturing structure with satisfiability;phase transitions and backbones of 3-sat and maximum 3-sat;solving non-binary CSPS using the hidden variable encoding;a filtering algorithm for the stretch constraint;network flow problems in constraint programming;pruning for the minimum constraint family and for the number of distinct values constraint family;components for state restoration in tree search;constraint-based verification of client-server protocols;lower bounds for non-binary constraint optimization problems;a general scheme for multiple lower bound computation in constraint optimization;solving disjunctive constraints for interactive graphical applications;non-overlapping constraints between convex polytopes;formal models of heavy-tailed behavior in combinatorial search;in search of a phase transition in the ac-matching problem;a CLP approach to the protein side-chain placement problem;solving constraints over floating-point numbers;optimal pruning in parametric differential equations;an efficient filtering technique combining domain partition and arc consistency;the expressive power of binary linear programming;the traveling tournament problem description and benchmarks;structural constraint-based modeling and reasoning with basic configuration cells;solving Boolean satisfiability using local search guided by unit clause elimination and fast optimal instruction scheduling for single-issue processors with arbitrary latencies.
暂无评论