Current explanation-based generalization (EBG) techniques can perform badly when the problem being solved involves recursion. Often an infinite series of learned concepts are generated that correspond to the expansion...
详细信息
In this paper we describe the concept of physical impossibility as an alternative to the specification of fault models. these axioms can be used to exclude impossible diagnoses similar to fault models. We show for Hor...
详细信息
this paper presents a formal theory of multiple agent non-monotonic reasoning. We introduce the subject of multiple agent non-monotonic reasoning for inquiry and motivate the field in terms of its applications for com...
详细信息
Causal theories are default theories which explicitly accommodate a distinction between 'explained' and 'unexplained' propositions. this is accomplished by means of an operator 'C in the language f...
详细信息
We describe a robot control architecture which combines a stimulus-response subsystem for rapid reaction, with a search-based planner for handling unanticipated situations. the robot agent continually chooses which ac...
详细信息
ET is a complete evaluation strategy for pure logic programs. the ET algorithm is an essentially depth-first strategy that uses extension tables, which save the answers of selected predicates, to evaluate (recursive) ...
详细信息
ISBN:
(纸本)081861918X
ET is a complete evaluation strategy for pure logic programs. the ET algorithm is an essentially depth-first strategy that uses extension tables, which save the answers of selected predicates, to evaluate (recursive) declarative specifications. the implementation of the ET algorithm in Prolog is straightforward and easily modifiable. the author presents variations of the ET algorithm that, under certain assumptions, improve the evaluation of declarative specifications.
the authors explore methodologies for effective realization of recursive procedures in logic programs. the effectiveness is achieved by reducing the number of context frames and interframe relations, through several r...
详细信息
ISBN:
(纸本)081861918X
the authors explore methodologies for effective realization of recursive procedures in logic programs. the effectiveness is achieved by reducing the number of context frames and interframe relations, through several related schemes. During programming or preprocessing, a subset of recursive procedures are transformed into ones that ensure the application of last call optimizations;the procedures can then be transformed into ones that allow multiple use, when desirable. During parallel interpretation, structured data are manipulated by a scheme that dynamically applies structure sharing or copying with little overhead. A communication scheme can then be used to realize transformed doubly recursive procedures. Withthese schemes the process structures of the transformed procedures coincide withthe data structures of the procedures, and the transformed procedures achieve efficiencies up to an order of magnitude in time, space, and interprocess communication over the untransformed ones.
the objective of this study is to show how a metalogicprogramming language, i.e., a logic language with fully developed, built-in metalevel features, is a suitable tool for formalization and use of several forms of r...
详细信息
ISBN:
(纸本)081861918X
the objective of this study is to show how a metalogicprogramming language, i.e., a logic language with fully developed, built-in metalevel features, is a suitable tool for formalization and use of several forms of reasoning. the role of metaknowledge in expressing auxiliary inference strategies is emphasized. Two case studies are presented to illustrate the proposed approach: one dealing with domain-specific concepts (formalization of a kind of analogical reasoning), the other related to domain-independent sentences (expression and composing general properties of relations). the two cases are then considered in combination, in order to show how the interaction of different kinds of metaknowledge can be coped with. Solutions to these problems are worked out both in reflective Prolog, a language with extensive metalevel capabilities that the authors are developing, and also in Prolog, for comparison and assessment of the proposed language. the concept of preprocessing metaknowledge at program-consultation time for a significant improvement in efficiency is introduced and applied to the problem areas considered.
the authors present an AND-parallelism detection scheme which does not order literals or analyze data dependency. the simple concept of variable holding allows the system to utilize AND-parallel literals concurrently ...
详细信息
ISBN:
(纸本)081861918X
the authors present an AND-parallelism detection scheme which does not order literals or analyze data dependency. the simple concept of variable holding allows the system to utilize AND-parallel literals concurrently without causing binding conflicts. the run-time support of this scheme is minimal: groundness test, independence test, and variable holding. Without extra runtime processing, this scheme also support an option mode declaration, which provides its programmers with greater flexibility to specify parallel execution. the execution graphs generated by this scheme are compared withthe graphs generated by other models. the authors find that this scheme generally uses the highest degree of parallelism.
Using the notions of logic field and ion defined in [7, 9], we give an algorithmic analysis, in terms of logicprogramming, of three paradoxes: Protagoras, Newcomb and the Hangman. We show that each one of these parad...
详细信息
暂无评论