Goto

Collaborating Authors

Verification of Knowledge-Based Programs over Description Logic Actions

AAAI Conferences

A knowledge-based program defines the behavior of an agent by combining primitive actions, programming constructs and test conditions that make explicit reference to the agent's knowledge. In this paper we consider a setting where an agent is equipped with a Description Logic (DL) knowledge base providing general domain knowledge and an incomplete description of the initial situation. We introduce a corresponding new DL-based action language that allows for representing both physical and sensing actions, and that we then use to build knowledge-based programs with test conditions expressed in the epistemic DL. After proving undecidability for the general case, we then discuss a restricted fragment where verification becomes decidable. The provided proof is constructive and comes with an upper bound on the procedure's complexity.


The Logic of Knowledge Bases: A Review

AI Magazine

As a result, they knowledge of an agent (that is, its epistemic coarse-grained level of abstraction, KBwould argue, it is not possible to discuss state) can be characterized as the Ss can be characterized in terms of two the knowledge of a system independently collection of all possible worlds that components: (1) a knowledge base, encoding of the task context in which are consistent with the knowledge the knowledge embodied by the system is meant to operate. I won't held by the agent. If the knowledge of the system, and (2) a reasoning engine, go into too many details here because the agent is complete, then the epistemic which is able to query the knowledge a detailed discussion of the declarative state contains only one world. A base, infer or acquire knowledge from versus the procedural argument is well nice feature of Levesque and Lakemeyer's external sources, and add new knowledge beyond the scope of this review. The treatment of epistemic logic is that to the knowledge base. Levesque important point to make is that in contrast to many other treatments and Lakemeyer's The Logic of Knowledge Levesque and Lakemeyer's approach is of modalities, the discussion is reasonably Bases deals with the "internal logic" of situated in a precise AI research easy to follow for people who are a KBS: It provides a formal account of paradigm, which considers knowledge not experts in the field. This is the result the interaction between a reasoning bases as declaratively specified, task-independent of two main features of this analysis: engine and a knowledge base.


The Logic of Knowledge Bases A Review

AI Magazine

Hence, at a coarse-grained level of abstraction, KB-Ss can be characterized in terms of two components: (1) a knowledge base, encoding the knowledge embodied by the system, and (2) a reasoning engine, which is able to query the knowledge base, infer or acquire knowledge from external sources, and add new knowledge to the knowledge base. A knowledge-level account of a KBS (that is, a competencecentered, implementation-independent description of a system), such as Clancey's (1985) analysis of first-generation rule-based systems, focuses on the task-centered competence of the system; that is, it addresses issues such as what kind of problems the KBS is designed to tackle, what reasoning methods it uses, and what knowledge it requires. In contrast with task-centered analyses, Levesque and Lakemeyer focus on the competence of the knowledge base rather than that of the whole system. Hence, their notion of competence is a task-independent one: It is the "abstract state of knowledge" (p. This is an interesting assumption, which the "proceduralists" in the AI community might object to: According to the procedural viewpoint of knowledge representation, the knowledge modeled in an application, its representation, and the associated knowledge-retrieval mechanisms have to be engineered as As a result, they would argue, it is not possible to discuss the knowledge of a system independently of the task context in which the system is meant to operate.


Playing a Strategy Game with Knowledge-Based Reinforcement Learning

arXiv.org Artificial Intelligence

This paper presents Knowledge-Based Reinforcement Learning (KB-RL) as a method that combines a knowledge-based approach and a reinforcement learning (RL) technique into one method for intelligent problem solving. The proposed approach focuses on multi-expert knowledge acquisition, with the reinforcement learning being applied as a conflict resolution strategy aimed at integrating the knowledge of multiple exerts into one knowledge base. The article describes the KB-RL approach in detail and applies the reported method to one of the most challenging problems of current Artificial Intelligence (AI) research, namely playing a strategy game. The results show that the KB-RL system is able to play and complete the full FreeCiv game, and to win against the computer players in various game settings. Moreover, with more games played, the system improves the gameplay by shortening the number of rounds that it takes to win the game. Overall, the reported experiment supports the idea that, based on human knowledge and empowered by reinforcement learning, the KB-RL system can deliver a strong solution to the complex, multi-strategic problems, and, mainly, to improve the solution with increased experience.


An Innovative Application from the DARPA Knowledge Bases Programs: Rapid Development of a Course-of-Action Critiquer

AI Magazine

First, we introduce the concept of a learning agent shell as a tool to be used directly by a subjectmatter of theories, methods, and tools that expert (SME) to develop an agent. In his invited talk at the 1993 National strategies. In addition, it supported the (MIT), Stanford University, and Conference on Artificial Intelligence, development of methods for rapidly Northwestern University, developed two Edward Feigenbaum compared the technology extracting knowledge from natural language end-to-end integrated systems that were of a knowledge-based computer texts and the World Wide Web evaluated by Information Extraction system with a tiger in a cage. Rarely does and for knowledge acquisition from subject and Transport Inc. (IET), the challenge a technology arise that offers such a matter experts (SMEs). However, emphasis of the HPKB Program was 1999. Both systems demonstrated high this technology is still far from the use of challenge problems, which are performance through knowledge reuse achieving its potential. This tiger is in a complex, innovative military applications and semantic integration and created a cage, and to free it, the AI research community of AI that are intended to focus the significant amount of reusable knowledge.