N. J. Nilsson, Artificial Intelligence: A New Synthesis. Morgan Kaufmann Publishers, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
A Question Answering Interpretation of Resolution Refutation - Burhans (2002) (Correct)
....in addition to answer literals, while the traditional definition of answer includes only clauses with no non answer literals. Luckham and Nilsson proposed a method for extracting answers from resolution proof trees [1971] Nilsson further refines the technique in his textbooks [Nilsson, 1980, Nilsson, 1998] As in traditional approaches, they focus on existence questions of the form 9x P(x) where in the general case x is a set of variables and P represents properties asserted to hold over the x. Existence questions may be viewed as yes no questions that ask whether or not there exist individuals ....
Nils J. Nilsson. Artificial Intelligence: A New Synthesis. Morgan Kaufmann Publishers, Inc., San Francisco, CA, 1998.
RoboCup in Higher Education: A Preliminary Report - Sklar, Parsons, Stone (2003) (Correct)
....a typical artificial intelligence syllabus using robotics projects. This course is designed to give a broad understanding of the basic techniques in use today for building intelligent computer systems. The syllabus broadly follows the outline of Nilsson s Artificial Intelligence: A new synthesis [25]. Students learn about state space representations, problem reduction, means end analysis, and reinforcement learning. They study search methods including depth first, breadth first and best first search, as well as hill climbing and alpha beta pruning. Predicate calculus is introduced, along with ....
N. J. Nilsson. Artificial Intelligence: A New Synthesis. Morgan Kaufmann, 1998.
Re-designing Cost-Sensitive Decision Tree Learning - Estruch, Ferri.. (Correct)
....of new models from this structure. For this reason we call it decision multi tree, rather than decision tree. Since each new model is obtained by extending the existing structure of the multi tree, these models share their common parts. A decision multi tree can also be seen as an AND OR tree [15, 17], if one consider the split nodes as OR nodes, and the nodes generated by an exploited OR node as AND nodes. For the construction of a decision multi tree it is necessary to specify two new criteria apart from the two required for the construction of a single decision tree. Suspended node ....
N.J. Nilsson. Artificial Intelligence: a new synthesis. Morgan Kaufmann, 1998.
A Framework for Comparing Agent Architectures - Sloman, Scheutz (2002) (2 citations) (Correct)
....attention disorders [2] though most psychologists and neuroscientists find it very difficult to think about virtual machine architectures. Shallice and Cooper are among the exceptions [4] In the meantime, AI researchers have been exploring many sorts of architectures. See Nilsson s account ([13], Ch 25) of triple tower and triple layer models. Architectures like SOAR, ACT R, and Minsky s Society of Mind have inspired many researchers, but there is no general overview of the space of interesting or important architectures, or the different types of requirements against which they can be ....
....kinds of information stores, and diverse information routes through the system, only a subset of which are shown. 3.2 Dimensions of architectural variation We present a first draft list of dimensions in which architectures can be compared. 1. Pipelined vs concurrently active layers Often [13] the layers have a sequential processing function: sensory information comes in via low level sensors ( bottom left ) gets abstracted as it goes up through higher central layers, until action options are proposed near the top, where some decision is taken (by the will ) and control information ....
N. Nilsson. Artificial Intelligence: A New Synthesis. Morgan Kaufmann, S. F., 1998.
Hybrid Computational Intelligence Schemes in Complex.. - Tsakonas, Dounias (2002) (Correct)
....is defined as any effective combination of intelligent techniques that performs superior or in a competitive way to simple standard intelligent techniques. A very thorough analysis of what is meant by computational intelligence and what the trends of modern AI are, can be found in [1] and [2]. Lately more and more researchers recognize and define as main components of computational intelligence, four areas of research that dominate the area of AI, namely, 1) fuzzy sets and soft computing, 2) neural networks, 3) genetic algorithms and evolutionary computing and (4) machine learning ....
Nilsson N. Artificial Intelligence: A New Synthesis. Morgan Kaufmann, 1998
Perception Management: An Emerging Concept for Information.. - Johansson, Xiong (2003) (1 citation) (Correct)
....theory, the term perception is frequently used and is widely recognized as an essential part of the agent model. Normally, the notion of perception is represented by a mapping f : # P, where is the set of environment states and P the set of percepts (i.e. outputs of the perception process) [20, 21, 22, 23, 24, 25, 26]. Figure 1 illustrates a common model of the agent perception action cycle. Robotics, being an application domain of both agent theory and computer vision, naturally inherits the term perception. This fact is made instructively clear in [27] where a robot system combines computer vision ....
N. J. Nilsson, Artificial Intelligence - A New Synthesis, Morgan Kaufmann Publishers Inc., 1998, Ch. 2, pp. 21--35.
The formal method known as B and a sketch for its implementation - Kaijanaho (2002) (Correct)
....for automated reasoning. In this chapter, we ll review the basic techniques. This chapter is not intended to be a comprehensive treatment of the subject. The basic methods of automated reasoning are covered by standard university textbooks on artificial intelligence, such as Nils Nilsson s [88] and George Luger and William Stubblefield s [78] More thoroghly it is described in Wos, Overbeek, Lusk and Boyle s book [126] A thoroughly theoretical but a little outdated account is given by Loveland [77] The recent North Holland handbook [100] is an advanced treatment. 4.1 The limits of ....
....procedure and a refutation procedure to fail to terminate; some contingent formulae are such. The fact that they indeed do exist follows from Church and Turing s theorem discussed in the previous chapter. Note that this terminology (uniformly used in publications in automated reasoning, such as [88, 78, 126, 77, 100]) may be confusing. A refutable formula is one that is not true in all possible worlds and interpretations. However, a refutation procedure does not detect refutable formulae but contradictions Higher order logic does not even have a proof procedure; this follows straightforwardly from ....
Nils J. Nilsson. Artificial Intelligence: A New Synthesis. San Francisco, CA: Morgan Kaufmann, 1998.
Emergent Situations in Interactive Storytelling - Marc Cavazza Fred (2002) (3 citations) (Correct)
.... narrative content a priori, our representations are actually explicit graphs (and this has implications for their automatic processing) From a formal perspective, the search process that is carried out by an AI planner takes an AND OR graph and generates from it an equivalent state space graph [9]. The process by which a state space graph is normally produced from a Hierarchical Task Network (HTN) is called serialisation [10] However, when the various sub goals are independent from one another, the planner can build a solution straightforwardly by directly searching the AND OR graph ....
.... AND OR graph without the need for serialising it [10] Further, there has been recently a renewed interest in search based planning techniques, as these have demonstrated significant performance on various planning tasks [10] 11] 12] 13] We thus use a real time variant of the AO algorithm [9] [14] 15] to search the AND OR graph. The AO algorithm is a heuristic We could refer to this interaction as the cross product of the individual characters plans. search algorithm operating on AND OR graphs: it can find an optimal solution sub graph, which in our case corresponds to a given ....
Nilsson, N.J., 1998. Artificial Intelligence: A New Synthesis. San Francisco, Morgan Kaufmann.
Agents' Interaction in Virtual Storytelling - Marc Cavazza Fred (2001) (3 citations) (Correct)
....a solution. Further, there has been recently a renewed interest in search based planning techniques, as these have demonstrated significant performance on various planning tasks [2] 10] 17] 23] As the task network for the characters is an AND OR graph, we naturally use the AO algorithm [9][15][16] to produce a solution. The solution takes the form of a sub graph (rather than a path like in traditional graph search) In our context, the terminal nodes of this sub graph correspond to a sequence of actions that constitute a specific instantiation of the storyline. These terminal actions ....
. Nilsson, N.J., 1998. Artificial Intelligence: A New Synthesis. San Francisco, Morgan Kaufmann.
A Framework for Comparing Agent Architectures - Sloman, Scheutz (2002) (2 citations) (Correct)
....a class of architectures and terminology for describing and comparing them, as illustrated in the next section. 3.2 Dimensions of architectural variation We present a first draft list of dimensions in which architectures can be compared. 1. Pipelined vs concurrently active layers Often [13] the layers have a sequential processing function: sensory information comes in via low level sensors ( bottom left ) gets abstracted as it goes up ## Our terminology is provisional. We refer to CogAff as a schema rather than an architecture because not every component specified in it must be ....
N. Nilsson. Artificial Intelligence: A New Synthesis. Morgan Kaufmann, San Francisco, 1998.
AI - A Multiple Book Review - Furbach (2003) Self-citation (Nilsson) (Correct)
....Textbooks on Artificial Intelligence o#er a unique trace of the development of our discipline. The topics and the focus has been changing over the decades: The first AI book I put my hands on was [Nilsson1971] and astonishing enough, the latest AI book I received is from the same author, Nilsson1998] Nearly 30 years of research have led to a considerable di#erence between the two books. While the first one was dealing, as the title promises, with Problem Solving Methods in Artificial Intelligence , the latter is aiming at the introduction of a new synthesis, a new definition of our field. ....
....various problems. According to the preface, the publisher also o#ers an Instructor s Guide and Solution Material on a floppy disk. On the publisher s web site (http: www.awprofessional.com) I found additional code and examples to download. A New Synthesis The title of the introductory textbook [Nilsson1998] promises a new synthesis, making the reader curious, what the ingredients of such a synthesis can be. Focus The synthesis is achieved by considering di#erent levels of an AI system. Starting with the design of simple agents, who are able to react to their environment, the book introduces ....
[Article contains additional citation context not shown here]
Nils J. Nilsson. Artificial Intelligence: A new Synthesis. Morgan Kaufmann, 1998.
Randomised Rough-Terrain Robot Motion Planning - Ettlin, Bleuler (2006) (Correct)
No context found.
N. J. Nilsson, Artificial Intelligence: A New Synthesis. Morgan Kaufmann Publishers, 1998.
Fundamenta Informaticae 68 (2005) 47--102 47 IOS Press - Calculus Of Bounded (Correct)
No context found.
Nilsson N., Artificial Intelligence: A New Synthesis, Morgan Kaufmann, 1998.
Rough-Terrain Robot Motion Planning based On Obstacleness - Ettlin, Bleuler (2006) (Correct)
No context found.
N. J. Nilsson, Artificial Intelligence: A New Synthesis. Morgan Kaufmann Publishers, 1998.
Fault Tolerance in Autonomous Systems: - How And How (Correct)
No context found.
N. J. Nilsson. Artificial Intelligence: A New Synthesis. Morgan Kaufmann Publishers, 1998. (ISBN 1-55860-467-7).
Metrics for Expert Systems Conceptualization - Yvind Hauge Paola (2006) (Correct)
No context found.
Nilsson, N., 1998, "Artificial Intelligence: A New Synthesis" (Mrgan Kaufmann, Palo Alato)
Experimenting A Multi-Agent Model: The Simac Model - Bellomo, Occelli (2004) (Correct)
No context found.
NILSSON N.J., 1998 Artificial Intelligence: a New Synthesis (Morgan Kaufman, San Francisco).
The ways to improve intelligence of interacting agents - Kopicki (2004) (Correct)
No context found.
N. J. Nilsson. Artificial Intelligence: A New Synthesis. Morgan Kaufmann, 1998.
Information Acquisition in Data Fusion Systems - Johansson (2003) (1 citation) (Correct)
No context found.
Nils J. Nilsson. Artificial Intelligence - A New Synthesis, chapter 2, pages 21--35. Morgan Kaufmann Publishers Inc., 1998.
Ec Information Society Technologies Programme - Cognitive Systems Integrated (Correct)
No context found.
NILSSON, N. Artificial Intelligence: A New Synthesis. Morgan Kaufmann, San Francisco, 1998.
Multiple Vehicle Team Tasking for Cooperative Estimation - Jarurat Ousingsawat And (Correct)
No context found.
Nilsson NJ, "Artificial Intelligence: A New Synthesis ", Morgan Kaufmann, 1998
An Environmental Multiagent Architecture - For Health Management (Correct)
No context found.
Nilsson, N.: Artificial Intelligence: A New Synthesis. Morgan Kaufmann, San Francisco, CA, USA (1998)
A Comparison of Traditional and Simple Evolutionary.. - Williams, Jr., Dozier (Correct)
No context found.
N. J. Nilsson. Artificial Intelligence: a new synthesis. Morgan Kaufman, San Francisco, 1998.
MEXI: Machine with Emotionally eXtended.. - ESAU.. (Correct)
No context found.
N. J. Nilsson, Artificial Intelligence - A New Synthesis, Morgan Kaufmann Publishers, 1998.
A Survey of Automated Layout Techniques for Information.. - Lok, Feiner (2001) (4 citations) (Correct)
No context found.
N. J. Nilsson. Artificial Intelligence: A New Synthesis. Morgan Kaufmann Publishers, San Francisco, 1998.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC