Approximation for knapsack problems with multiple constraints
In this paper, the approximation for four kinds of knapsack problems with multiple constraints is studied: 0/1 Multiple Constraint Knapsack Problem (0/1 MCKP), Integer Multiple Constraint Knapsack Problem (Integer MCKP), 0/1k-Constraint Knapsack ...
On the arc consistency problem
In this paper, we propose a new arc consistency algorithm, AC-8, which requires less computation time and space than AC-6 and AC-7. The main idea of the optimization is the divide-and-conquer strategy, thereby decomposing an arc consistency ...
Onk-positive satisfiability problem
An algorithm for solving the satisfiability problem is presented. It is proved that this algorithm solves 2-SAT and Horn-SAT in linear time andk-positive SAT (in which every clause contains at mostk positive literals) in timeO(|F|·ξnk), where |F| ...
An incremental approach to automatic algorithm design
This paper presents an incremental approach to automatic algorithm design, which can be described by algebraic specifications precisely and conveniently. The definitions of selection operator and extension operator which can be defined by strategy ...
Relative properties of frame language
The paper discusses semantics of encodings in logical frameworks where equalities in object calculi are represented by families of types as the case inELF. The notion of Leibniz equality in a category is introduced. Two morphisms in a category are ...
Topology in process calculus (I): Limit behaviour of agents
This paper introduces the modifications on actions of a topology on names of actions and the simplest topology on agents induced by a topology on names of actions and shows that the limit behaviour of some agents is compatible with transitional ...
The sequence modeling method based on ECC in developing program specifications
This article discusses the developing process of the version sequences of specifications and the formal expressions of various reconstructions including the expansion and revision of the version at each stage. The author suggests using ECC (...
View creation for queries in object oriented databases
A view in object oriented databases corresponds to virtual schema with restructured generalization and decomposition hierarchies. Numbers of view creation methodologies have been proposed. A major drawback of existing methodologies is that they do ...
A theory of hybrid diagnosis
This paper establishes a formal model for hybrid diagnosis, novel features including: (1) It provides a unified theoretical framework for utilizing device models and heuristics in diagnosis, which naturally integrates all the important components ...
An approach to active learning for classifier systems
In this paper, the active learning mechanism is proposed to be used in classifier systems to cope with complex problems: an, intelligent agent leaves its own signals in the environment and later collects and employs them to assist its learning ...
Fault tolerance of reconfigurable bi-directional double-loop LANs
Double-loop is a very popular structure in loop network topology. A reconfigurable bi-directional double-loop structure is recently developed. It has a new structure which is different from any existing double-loop structure and no previous ...
Isomorphic transformations of uncertainties for incorporating EMYCIN-style and PROSPECTOR-style systems into a distributed expert system
In the past, expert systems exploited mainly the EMYCIN model and the PROSPECTOR model to deal with uncertainties. In other words, a lot of stand-alone expert systems which use these two models are available. If we can use the Internet to couple ...
RAO logic for multiagent framework
In this paper, we deal with how agents reason about knowledge of others in multiagent system. We first present a knowledge representation framework called reasoning about others (RAO) which is designed specifically to represent concepts and rules ...
Automated analysis of the SCR-style requirements specifications
The SCR (Software Cost Reduction) requirements method is an effective method for specifying software system requirements. This paper presents a formal model analyzing SCR-style requirements. The analysis model mainly applies state translation ...
Dynamic checking framework for Java Beans semantic constraints
Java Beans is a standard for software components. For checking the consistency of the Java Beans semantic constraints with its implementation, this paper proposes a formal Java Beans Description Language (JBDL) to specify component semantic ...
Function Definition Language FDL and its implementation
A Function Definition Language (FDL) is presented. Though designed for describing specifications, FDL is also a general-purpose functional programming language. It uses context-free language as data type, supports pattern matching definition of ...
Reasoning about concurrent actions in multi-agent systems
Concurrence is an important research area in collaborative problem solving. This paper offers a formal definition for cooperative sequences in multi-agent systems, discusses the different categories of concurrent actions, and proposes some rules ...
Genetic Programming with simple loops
A kind of loop function LoopN in Genetic Programming (GP) is proposed. Different from other forms of loop function, such as While-Do and Repeat-Until, LoopN takes only one argument as its loop body and makes its loop body simply runN times, so ...
