Showing papers in "Artificial Intelligence in 1985"

TL;DR: This heuristic depth-first iterative-deepening algorithm is the only known algorithm that is capable of finding optimal solutions to randomly generated instances of the Fifteen Puzzle within practical resource limits.

TL;DR: The paper shows how opm, a blackboard control system for multiple-task planning, exploits these capabilities and shows how the architecture would replicate the control behavior of hearsay-ii and hasp.

TL;DR: This paper gives a reconstruction of nonmonotonic logic as a model of an Ideally rational agent's reasoning about his own beliefs, and defines an Intuitively based semantics for which it can show autoeplstemlc logic to be both sound and complete.

TL;DR: The time complexity of several node, arc and path consistency algorithms is analyzed and it is proved that arc consistency is achievable in time linear in the number of binary constraints.

TL;DR: This paper describes the central elements of the Dempster–Shafer (D-S) theory of evidence and demonstrates the relevance of the D-S theory to a familiar expert-system domain, namely the bacterial-organism identification problem that lies at the heart of the mycin system.

TL;DR: The macro technique is a new kind of weak method, a method for learning as opposed to problem solving, and introduces a new type of problem structure called operator decomposability.

TL;DR: This paper presented a computational model of discourse strategies that can be used to guide the generation process in its decisions about what to say next and showed how this model has been implemented in text, a system which generates paragraph-length responses to questions about database structure.

TL;DR: A canonical term-rewriting system for Boolean algebra is introduced, which enables the first-order predicate calculus to be transformed into a form of equational logic and several complete strategies for first- order theories based on the Knuth-Bendix Completion Procedure are developed.

TL;DR: Robotics challenges AI by forcing it to deal with real objects in the real world by adapting techniques and representations developed for purely cognitive problems to meet the challenge.

TL;DR: In this paper, the surface tilt is related to the direction of the gray level gradient at the given point, and an alternative formulation of the surface slant probability density is developed that takes the discrete nature of digital images into account, and that yields a better estimate of the light source direction.

TL;DR: This paper carefully formulated the definition of a special type of implication (called ‘sub-implication’) to avoid this type of paradox and developed a decidable algorithm to compute whether P implies q, q being practically any formula.

TL;DR: A theory of language generation based on planning makes it possible for one to account for noun phrases that refer, that inform the hearer of additional information, and that are coordinated with the speaker's physical actions to clarify his communicative intent.

TL;DR: A theory of quotation and unquotation is presented to this end that appears to make unnecessary the usual hierarchical and non-first-order constructions for these notions.

TL;DR: The structure of a class of divide-and-conquer algorithms is explored and provides the basis for several design strategies and detailed derivations of mergesort and quicksort algorithms are presented.

TL;DR: A planner which operates by iteratively constraining a loosely constrained initial plan built from the model of the part to be machined, which makes use of a selective backtracking procedure which reasons about the weights attached to the applied constraints for deciding which compromise is ‘best’.

TL;DR: This work compares the rule-learning programs of Brazdil, Langley, Mitchell, Mitchell et al, Shapiro, Waterman, and Quinlan with the concept- learning programs of Quinlan, and Young et al.

TL;DR: The problem of determining the best ordering for a set of conjuncts is addressed and an approach of monitoring problem-solving cost at run-time is presented to help reduce the overhead.

TL;DR: A program, called SPARC/E, is described that implements most of the methodology as applied to discovering sequence generating rules in the card game Eleusis, and is used as a source of examples for illustrating the performance of SPARC /E.

TL;DR: In this paper, the authors demonstrate the advantage of using a many-sorted resolution calculus by a mechanical solution of a challenge problem known as Schubert's Steamroller, which had been solved by automated theorem provers before.

TL;DR: NEXUS, a computational system which uses a dictionary of 100 to 150 event/state concepts to construct representations of narrative text, has been successfully applied to eight paragraph-length samples of text.

TL;DR: Everyday expertise or know-how does not consist of the principles and rules of thumb thought to comprise common-sense knowledge, and the authors fall back on procedures and principles only in situations which are so unlike any situation they have dealt with that their everyday skills fail.

TL;DR: An efficient way of labeling a line-drawing image is described and it is shown how to utilize the line-labeling and junction- labeling information to group together faces of the same object volume and predict the simplest arrangement and types of the hidden vertices caused by the overlapping of objects.

TL;DR: The purpose of this note is to show that the theorem stated by Pednault et al. is false, as is the result claimed by Hussian.

TL;DR: A method for decomposing a problem into some intermediate problems using a solution of the quotient problem constructed through certain information about a relationship between differences and means and the success of the method is investigated.

TL;DR: In this paper, the authors propose a data-driven model for pattern-matching in a semantic network, where each node is an active element capable of accepting, processing, and emitting data tokens traveling asynchronously along the network arcs.