We describe a course intended to introduce second-year undergraduates to medium-scale programming. the project of the course is to implement a nonconventional logic programming language using a functional implementati...
详细信息
this paper is based on an experience in teaching functionalprogramming to mathematics students. this experience had two objectives. the first one was to help the student assimilate some mathematical concepts by putti...
详细信息
We introduce a framework for managing as a whole the space of a narrowing computation. the aim of our framework is to find a finite representation of an infinite narrowing space. this, in turn, allows us to replace an...
详细信息
the development of the World Wide Web (WWW) has been considerably delayed due to the excessive complexity of developing advanced and intelligent applications for the Internet. An average application may require the us...
详细信息
ISBN:
(纸本)0818682043
the development of the World Wide Web (WWW) has been considerably delayed due to the excessive complexity of developing advanced and intelligent applications for the Internet. An average application may require the use of different languages, an in-depth understanding of various communication protocols and low-level communication. mechanisms, etc. In this paper we propose a logic programming system, called W-ACE, extended with various features to support natural and efficient development of Internet tools. the nature of the constructs introduced makes it particularly suitable to support intelligent Internet applications (knowledge-based systems, agents, etc.). W-ACE covers various issues in supporting knowledge-based handling of the World Wide Web, allowing structured and constraint-based management of WWW information, passive and active view of WWW, as well as a powerful support for concurrent applications. Various examples of complex intelligent applications are presented, to underline the simplicity and the power of the proposed ideas.
A standard approach to solve Mixed Integer Linear Programs is to perform a global branch and bound search through all possible combinations. Due to the hardness of the problem, this search must be closely controlled b...
详细信息
ISBN:
(纸本)0818682043
A standard approach to solve Mixed Integer Linear Programs is to perform a global branch and bound search through all possible combinations. Due to the hardness of the problem, this search must be closely controlled by a constraint solver which uses constraints to prune the search space in an a priori way. In this paper, we define a new domain reduction solver which uses in a cooperative way a set of Linear programming solvers. the idea is to compute the actual range of valves of the integer variables with respect to the continuous relaxation of the problem, and then narrow these domains to the closest integer interval. this narrowing is iteratively performed until a fixed point is reached where all domains are bound by integer valves which belong to the continuous relaxation of the problem. this fixed point corresponds to a new partial consistency, which is stronger than the continuous relaxation and allows us do solve MILPs more efficiently.
the paper concentrates on the problem how to integrate genetic programming, neural networks, autonomous agents with some symbolic AI techniques. For this purpose, it introduces and employs the $-calculus, which is a g...
详细信息
the paper concentrates on the problem how to integrate genetic programming, neural networks, autonomous agents with some symbolic AI techniques. For this purpose, it introduces and employs the $-calculus, which is a general model of computation with a quantitative aspect (cost) allowing naturally to express optimization and modification in dynamic parallel AI systems. the papers presents basic operators of the calculus, and a basic inference engine, so called modifying algorithm, used for problem solving. Next the approach is illustrated through a series of examples from various domains, including symbolic and subsymbolic systems.
A methodology is introduced for the automatic generation of theorem provers from sets of proof examples. As an example, this methodology was used to generate a theorem prover for Intuitionistic Propositional Calculus ...
详细信息
A methodology is introduced for the automatic generation of theorem provers from sets of proof examples. As an example, this methodology was used to generate a theorem prover for Intuitionistic Propositional Calculus which proves any theorem for this logic found in [13], using depth-first search strategy without loop detection.
We incorporate object oriented features into the functional language Haskell: inheritance and methods with super and self references. Parametric polymorphism is retained in object classes. Interfaces are used to descr...
详细信息
VeriSoft is a tool for systematically exploring the state spaces of systems composed of several concurrent processes executing arbitrary code written in full-fledged programming languages such as C or C++. It can auto...
详细信息
ISBN:
(纸本)3540631666
VeriSoft is a tool for systematically exploring the state spaces of systems composed of several concurrent processes executing arbitrary code written in full-fledged programming languages such as C or C++. It can automatically detect coordination problems between concurrent processes. Specifically, VeriSoft searches the state space of the system for deadlocks, livelocks, divergences, and violations of user-specified assertions. An interactive graphical simulator/debugger is also available for following the execution of all the processes of the concurrent system.
Traditional analytic or control-theoretic solutions to the problem of optimizing evasive maneuvers in the extended two-dimensional pursuer/evader problem require the evader to execute specific sequences of maneuvers a...
详细信息
Traditional analytic or control-theoretic solutions to the problem of optimizing evasive maneuvers in the extended two-dimensional pursuer/evader problem require the evader to execute specific sequences of maneuvers at precise pursuer/evader distances. these solutions depend upon several pursuer-specific characteristics, and fail to effectively account for uncertainty about the state of the pursuer. this paper describes the implementation of a genetic programming system that evolves optimized solutions to the extended two-dimensional pursuer/evader problem that do not depend upon knowledge of pursuer's current state. Best-of-run programs execute strategies by which an evader may maneuver to successfully evade a pursuer starting from a wide range of relative initial positions, under conditions where the state of the pursuer is unknown or uncertain.
暂无评论