In this brief history, the beginnings of artificial intelligence are traced to philosophy, fiction, and imagination. Early inventions in electronics, engineering, and many other disciplines have influenced AI. Some early milestones include work in problems solving which included basic work in learning, knowledge representation, and inference as well as demonstration programs in language understanding, translation, theorem proving, associative memory, and knowledge-based systems. The article ends with a brief examination of influential organizations and current issues facing the field.

L. Frank Baum, who gave us the Wizard he history of AI is a history of fantasies, promise. Ever since Homer wrote of mechanical of Oz. Baum wrote of several robots and described "tripods" waiting on the gods at dinner, the mechanical man Tiktok in 1907, for imagined mechanical assistants have been example, as an "Extra-Responsive, Thought-a part of our culture. However, only in the last Creating, Perfect-Talking Mechanical Man … half century have we, the AI community, been Thinks, Speaks, Acts, and Does Everything but able to build experimental machines that test Live." These writers have inspired many AI researchers.

I claim that achieving real human-level artificial intelligence would necessarily imply that most of the tasks that humans perform for pay could be automated. Rather than work toward this goal of automation by building special-purpose systems, I argue for the development of general-purpose, educable systems that can learn and be taught to perform any of the thousands of jobs that humans can perform. Joining others who have made similar proposals, I advocate beginning with a system that has minimal, although extensive, built-in capabilities. These would have to include the ability to improve through learning along with many other abilities.

What Do We Know about Knowledge? In this article, I will examine the first of these questions. AI has been slow to embrace this principle. Programs demonstrating research ideas in AI are often too large and not well enough documented to allow replication or sharing. What I would like to in diverse conditions. I wish to clarify the knowledge example, it was pretty clearly articulated in Biblical principle and try to increase our understanding times: "A man of knowledge increaseth of what programmers and program strength" (Proverbs 24: 5). Greek philosophers based their lives on acquiring The "knowledge is power" principle is most and transferring knowledge. In the course closely associated with Francis Bacon, from his of teaching, they sought to understand the 1597 tract on heresies: "Nam et ipsa scientia nature of knowledge and how we can establish potestas est." ("In and of itself, knowledge is knowledge of the natural world. B," along with quantification, "All A's are B's," Euclid's geometry firmly established the concept In the intervening several centuries before Plato, Socrates's pupil and Aristotle's mentor, was the first to pose the question in writing of the Middle Ages and the rise of modern science what we mean when we say that a person in the West, He was distinguishing empirical knowledge, church to make new knowledge fit with established lacking complete certainty, from the certain dogma.

Despite recent progress in AI planning, many benchmarks remain challenging for current planners. In many domains, the performance of a planner can greatly be improved by discovering and exploiting information about the domain structure that is not explicitly encoded in the initial PDDL formulation. In this paper we present and compare two automated methods that learn relevant information from previous experience in a domain and use it to solve new problem instances. Our methods share a common four-step strategy. First, a domain is analyzed and structural information is extracted, then macro-operators are generated based on the previously discovered structure. A filtering and ranking procedure selects the most useful macro-operators. Finally, the selected macros are used to speed up future searches. We have successfully used such an approach in the fourth international planning competition IPC-4. Our system, Macro-FF, extends Hoffmann's state-of-the-art planner FF 2.3 with support for two kinds of macro-operators, and with engineering enhancements. We demonstrate the effectiveness of our ideas on benchmarks from international planning competitions. Our results indicate a large reduction in search effort in those complex domains where structural information can be inferred.

In this article I discuss a deployed application at Ford Motor Company that utilizes AI technology for the analysis of potential ergonomic concerns at Ford's assembly plants. The manufacture of motor vehicles is a complex and dynamic problem, and the costs related to workplace injuries and lost productivity due to bad ergonomic design can be very significant. Ford has developed two separate ergonomic analysis systems that have been integrated into the process planning for manufacturing system at Ford known as the Global Study and Process Allocation System (GSPAS). GSPAS has become the global repository for standardized engineering processes and data for assembling all Ford vehicles, including parts, tools, and standard labor time. One of the more significant benefits of GSPAS is the use of a controlled language, known as Standard Language, which is used throughout Ford to write the process assembly instructions. AI is already used within GSPAS for Standard Language validation and direct labor management. The work described here shows how Ford built upon its previous success with AI to expand the technology into the new domain of ergonomics analysis.

Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to 'concrete' domains like numbers and strings with built-in predicates such as >, +, and prefix-of. These hybrid DLs have turned out to be useful in several application areas, such as reasoning about conceptual database models. We propose to further extend such DLs with key constraints that allow the expression of statements like 'US citizens are uniquely identified by their social security number'. Based on this idea, we introduce a number of natural description logics and perform a detailed analysis of their decidability and computational complexity. It turns out that naive extensions with key constraints easily lead to undecidability, whereas more careful extensions yield NExpTime-complete DLs for a variety of useful concrete domains.

This is the third of three papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal has been to define a representation in which this structure is apparent and can be exploited to improve computational performance. The first paper surveyed existing work that (knowingly or not) exploited problem structure to improve the performance of satisfiability engines, and the second paper showed that this structure could be understood in terms of groups of permutations acting on individual clauses in any particular Boolean theory. We conclude the series by discussing the techniques needed to implement our ideas, and by reporting on their performance on a variety of problem instances.

Data integration is the problem of combining data residing at different autonomous, heterogeneous sources and providing the client with a unified, reconciled global view of the data. We discuss dataintegration systems, taking the abstract viewpoint that the global view is an ontology expressed in a class-based formalism. We resort to an expressive description logic, ALCQI, that fully captures classbased representation formalisms, and we show that query answering in data integration, as well as all other relevant reasoning tasks, is decidable. However, when we have to deal with large amounts of data, the high computational complexity in the size of the data makes the use of a fullfledged expressive description logic infeasible in practice. This leads us to consider DL-Lite, a specifically tailored restriction of ALCQI that ensures tractability of query answering in data integration while keeping enough expressive power to capture the most relevant features of class-based formalisms.

In this paper, we construct and investigate a hierarchy of spatio-temporal formalisms that result from various combinations of propositional spatial and temporal logics such as the propositional temporal logic PTL, the spatial logics RCC-8, BRCC-8, S4u and their fragments. The obtained results give a clear picture of the trade-off between expressiveness and `computational realisability' within the hierarchy. We demonstrate how different combining principles as well as spatial and temporal primitives can produce NP-, PSPACE-, EXPSPACE-, 2EXPSPACE-complete, and even undecidable spatio-temporal logics out of components that are at most NP- or PSPACE-complete.