This paper presents two parallel semantics of constraint logic programs: multiset answer constraint semantics and game semantics, which differ entirely from the traditional semantics. When giving the first semantics, ...
详细信息
This paper presents two parallel semantics of constraint logic programs: multiset answer constraint semantics and game semantics, which differ entirely from the traditional semantics. When giving the first semantics, it adopts the s-semantics approach, whose aim is to find notions of models which really capture the operational semantics. And it defines the program equivalence based on multiset answer constraint. Then it investigates the game semantics and proves that it is consistent with traditional operational semantics. On the basis of these two semantics, programmers can comprehend the programs deeply and develop more sound parallel constraint logic programming systems. Finally, it gives the conclusions and future work.
This paper discusses a methodology for applying general-purpose first-order inductive learning to extract information from Web documents structured as unranked ordered trees. The methodology is applied to information ...
详细信息
This paper discusses a methodology for applying general-purpose first-order inductive learning to extract information from Web documents structured as unranked ordered trees. The methodology is applied to information extraction from real-world HTML page sets that represent product information sheets, an important task in product data integration. The methodology addresses the problems of defining information extraction rules in the form of logic wrappers and mapping the task of learning these rules to general purpose first-order inductive learning.
The paper deals with the partial automation of cars for safety purposes. We have tried to automate the car to prevent the danger (obstacles around the car) in the best possible way by incorporating intelligence to it ...
详细信息
The paper deals with the partial automation of cars for safety purposes. We have tried to automate the car to prevent the danger (obstacles around the car) in the best possible way by incorporating intelligence to it with the help of microcontrollers and interfacing them with the basic structures of the braking, steering and the acceleration systems of the car. The actions required are taken only if the driver is not able to steer the car out of danger even after he is alerted. We have given preference to a particular direction with respect to other directions in the most practical way and in a particular sequence so that only one system (i.e. braking, steering and the acceleration) works at a given instant of time. The proposed system can be implanted in a manually driven car at a very low cost
This article presents an approach to solve the typing problem using algorithms for set covering. Two algorithms to solve this problem were designed and compared. The typing problem consists of distinguishing all seque...
详细信息
This article presents an approach to solve the typing problem using algorithms for set covering. Two algorithms to solve this problem were designed and compared. The typing problem consists of distinguishing all sequences using the least possible reagents. For each reagent, their capacity to distinguish between pairs of sequences is represented in a matrix and-then mapped to the set-covering problem. In (J. Lozano Yecora, MS Thesis. Uni. de las Americas, Puebla, Dept. of Comp. Science, 2004), a proof of the equivalence of this problem with the set covering problem is presented; here, the results of an exact algorithm to solve the set-covering problem are presented. This algorithm uses a branch and bound method based on some intuitive properties of the solution, applying recursion as the final resource. Two approximation algorithms were also implemented and tested. One is an improved greedy algorithm and the other is based on dynamic programming. Real as well as randomly created instances were used to test the algorithms.
We propose a simple compositional program logic for an imperative extension of call-by-value PCF, built on Hoare logic and our preceding work on program logics for pure higher-order functions. A systematic use of name...
详细信息
We propose a simple compositional program logic for an imperative extension of call-by-value PCF, built on Hoare logic and our preceding work on program logics for pure higher-order functions. A systematic use of names and operations on them allows precise and general description of complex higher-order imperative behaviour. The logic offers a foundation for general treatment of aliasing and local state on its basis, with minimal extensions. After establishing soundness, we prove that valid assertions for programs completely characterise their behaviour up to observational congruence, which is proved using a variant of finite canonical forms. The use of the logic is illustrated through reasoning examples which are hard to assert and infer using existing program logics.
In this paper we present a many-valued logic programming, based on reinterpreted Belnap's 4-valued bilattice: we introduce the new semantics for a 4-valued implication by relative pseudo-complement, used for intui...
详细信息
In this paper we present a many-valued logic programming, based on reinterpreted Belnap's 4-valued bilattice: we introduce the new semantics for a 4-valued implication by relative pseudo-complement, used for intuitionistic logics. This kind of logic programming is particularly useful for data integration with possibly incomplete and inconsistent information. We define an ontological encapsulation of the epistemic many-valued logic programs with negation, based on this bilattice, into 2-valued meta logic programs. Obtained 2-valued logic semantically reflects original epistemic many-valued logic, and can be used in order to define many-valued logic entailment and inference closure for many-valued truth assignments.
This paper proposes agent-based formulation of a Supply Chain Management (SCM) system for manufacturing firms. We model each firm as an intelligent agent, which communicates each other through the blackboard architect...
详细信息
This paper describes the use of mobile agent technologies in building a framework for supporting distributed logic programming. The distinctive idea is to replace the distributed unification mechanism in most distribu...
详细信息
ISBN:
(纸本)0769517609
This paper describes the use of mobile agent technologies in building a framework for supporting distributed logic programming. The distinctive idea is to replace the distributed unification mechanism in most distributed logic programming languages with the mobility and execution locality of mobile agents. Mobile agents, migrating among logic server hosts, accomplish distributed deductions by asserting program clauses and queries into the server triggering inferences, and retrieving results. The mobile agent framework is designed to integrate a mobile agent system and necessary logic servers. One of the distinguishing features of this framework is that each logic server retains its own autonomy. Another notable characteristic is the clauses exchange ability among distributed logic servers that may make many operations required by distributed knowledge processing easier. In a prototypical implementation, a Prolog system on a host will serve as a logic server and, in the mean time, as a standalone logic programming system in the host.
Neural-Symbolic integration has become a very active research area in the last decade. In this paper, we present a new massively parallel model for modal logic. We do so by extending the language of Modal Prolog to al...
详细信息
Neural-Symbolic integration has become a very active research area in the last decade. In this paper, we present a new massively parallel model for modal logic. We do so by extending the language of Modal Prolog to allow modal operators in the head of the clauses. We then use an ensemble of C-IL/sup 2/p neural networks to encode the extended modal theory (and its relations), and show that the ensemble computes a fixpoint semantics of the extended theory. An immediate result of our approach is the ability to perform learning from examples efficiently using each network of the ensemble. Therefore, one can adapt the extended C-IL/sup 2/P system by training possible world representations.
Complex automatic systems require high level discrete event control and low-level implementation. To date in industry, programmable logic controllers dominate the application domain. Detailed analysis of the system wi...
详细信息
Complex automatic systems require high level discrete event control and low-level implementation. To date in industry, programmable logic controllers dominate the application domain. Detailed analysis of the system with discrete event controller (PLC) is not readily available. A methodology of converting the LLD (PLC programming) into a Petri net is developed in this paper. The developed Petri net model captures the dynamics of the system and analyzes the qualitative and quantitative aspects of the system. One of the modeling tools of Petri net namely visual object net is used in this paper for simulation. It provides graphical, mathematical and visual modeling support.
暂无评论