Theoretical results for identifying unnecessary inferences are discussed in the context of the use of a completion-procedure-based approach toward automated reasoning. The notion of a general superposition is introduc...
详细信息
Theoretical results for identifying unnecessary inferences are discussed in the context of the use of a completion-procedure-based approach toward automated reasoning. The notion of a general superposition is introduced and it is proved that in a completion procedure, once a general superposition is considered, all its instances are unnecessary inferences and, thus, do not have to be considered. It is also shown that this result can be combined with another criterion, called the prime superposition criterion, proposed by Kapur, Musser, and Narendran, thus implying that prime and general superpositions are sufficient. These results should be applicable to other approaches toward automated reasoning, too. These criteria can be effectively implemented, and their implementation has resulted in automatically proving instances of Jacobson's theorem (also known as the ring commutativity problems) usingRRL (Rewrite Rule Laboratory), a theorem prover based on rewriting techniques and completion.
A system is a collection of processes connected by channels over which they communicate. We consider systems where processes can be communicated. We propose an extension to propositional temporal logic as specificatio...
详细信息
In this paper definite Horn clause programs are investigated within a proof-theoretic framework;program clauses being considered rules of a formal system. Based on this approach, the soundness and completeness of SLD-...
详细信息
We discuss a sequent style clause-based proof system that supports several important strategies in automatic theorem proving. The system has a goal-subgoal structure and supports back chaining with caching;it permits ...
详细信息
The authors present a paradigm for automating programming based on how humans program. The paradigm involves top-down decomposition of a given problem into smaller problems using, if possible, programming cliches and ...
详细信息
The authors present a paradigm for automating programming based on how humans program. The paradigm involves top-down decomposition of a given problem into smaller problems using, if possible, programming cliches and analogies from previously solved problems till a primitive level is reached; at the primitive level the problem is solved by making calls to a library of pre-existing sub-routines that encode specific knowledge about the domain. The authors describe APU, which uses the above paradigm to automate UNIX programming, and focus on the knowledge structure and the problem-solving capability without the use of analogy.< >
Robot applications, represented as plans, are used to outline a viewpoint that robustness needs to be emphasized in two areas: in the plan representation and in the underlying system software. Robot applications are i...
详细信息
ISBN:
(纸本)0818620811
Robot applications, represented as plans, are used to outline a viewpoint that robustness needs to be emphasized in two areas: in the plan representation and in the underlying system software. Robot applications are inherently distributed, since the hardware usually comprises a set of independent actuators and sensors, with the robot programs acting as links between them. A special model of distributed computation, the RS (Robot Schemas) model, has been designed to handle the issues of robot plan representation, and an overview of the model is presented. An initial implementation of the model with minimal execution support demonstrated that the domain-dependent aspect of robustness on its own was not sufficient for robust behavior. Consequently, the OS has been augmented with real-time scheduling, and monitoring facilities.< >
The construction of real-time software for autonomous robot systems that can operate in an uncertain and dynamic environment is considered. Techniques for representing robust robot plans using the RS (robot schema) mo...
详细信息
The construction of real-time software for autonomous robot systems that can operate in an uncertain and dynamic environment is considered. Techniques for representing robust robot plans using the RS (robot schema) model are developed which make it possible to separate planned decision-making from error monitoring; they give a modular way to embed error detection, diagnosis, and recovery into plans, and via the formal tools of RS they allow one to analyze plans for error behavior. However, experience in implementing the RS kernel leads to the conclusion that robustness in the plan representation alone is not sufficient. Robustness must also be incorporated in the underlying system software to complement robustness in the plan representation model. Experiences with the initial implementation of the RS execution environment kernel also emphasized the need for operating system constructs that would support the robustness inherent in the model.< >
作者：
Skogsvik, KenthThe author is from the Department of Accounting and Finance
Stockholm School of Economics Sweden. The article is based on his Ph.D. dissertation. He wishes to thank his advisor Professor Sven‐Erik Johansson for encouragement and advice. Also he is grateful for many helpful comments by Professor Nils Hakansson (University of California Berkeley) Matti Kinnunen and Eva Widhem. The computer programming for the project was executed by Matti Kinnunen and Eva Widhem. Financial support for the research was provided by Bankforskningsinstitutet and Carl‐Berthel Nathhorsts Vetenskapliga Stiftelse.
This paper is about specification and verification of processes, modelled as CCS-agents. We show, by means of examples that Hennessy-Milner Logic (HML) with recursion is a suitable language for expressing implicit or ...
详细信息
Networks of communicating processes can be viewed as networks of stream transformers and programmed in a lazy functional language. Thus the correctness of concurrent systems can be reduced to the correctness of functi...
详细信息
暂无评论