We define TRIO+, an Object Oriented logic language for modular system specification. TRIO+ is based on TRIO, a first order modal language that is well suited to the specification of embedded and real-time systems, and...
详细信息
A goal-directed logicprogramming system is presented, and an experimental implementation is described. It differs from other logicprogramming languages in that a goal that has just failed has certain of its variable...
详细信息
A goal-directed logicprogramming system is presented, and an experimental implementation is described. It differs from other logicprogramming languages in that a goal that has just failed has certain of its variables unbound and is immediately re-evaluated. this control mechanism gives priority to the failed goal until it either succeeds or fails for good. the modifications required are considerable, since they require freeing the control structure of logicprogramming from its emphasis on backtracking and on the order of unbinding and rebinding variables that it entails. the backtrack mechanisms normal to logicprogramming lack goal direction and are therefore not part of the system. Examples are given to show the advantages of the system presented over other approaches to logicprogramming.
A goal-directed logicprogramming system is presented, and an experimental implementation is described. It differs from other logicprogramming languages in that a goal that has just failed has certain of its variable...
详细信息
A goal-directed logicprogramming system is presented, and an experimental implementation is described. It differs from other logicprogramming languages in that a goal that has just failed has certain of its variables unbound and is immediately re-evaluated. this control mechanism gives priority to the failed goal until it either succeeds or fails for good. the modifications required are considerable since they require freeing the control structure of logicprogramming from its emphasis on backtracking and on the order of unbinding and rebinding variables that it entails. the backtrack mechanisms normal to logicprogramming lack goal direction and are therefore not part of the system. Examples are given to show the advantages of the system presented over other approaches to logicprogramming.< >
A parallel implementation of rewriting and narrowing is described. the implementation is written in Flat Concurrent Prolog (FCP) but may be coded in any system in which processes are capable of creating other processe...
详细信息
A parallel implementation of rewriting and narrowing is described. the implementation is written in Flat Concurrent Prolog (FCP) but may be coded in any system in which processes are capable of creating other processes and communicating with each other. the Towers of Hanoi problem, parallel merging, and evaluating algebraic expressions are treated as examples of rewriting. Running programs under the interpreter and using facilities provided by the FCP system has provided empirical evidence of parallel speedup in support of theoretical predictions.< >
the important concepts concerning object-oriented databases (OODBs) are reviewed. the shortcomings of the relational model in supporting nontraditional applications are outlined. OO features are explained and how they...
详细信息
the important concepts concerning object-oriented databases (OODBs) are reviewed. the shortcomings of the relational model in supporting nontraditional applications are outlined. OO features are explained and how they can be used to overcome the above mentioned shortcomings is indicated. the issue of developing a declarative query language for OODBs is briefly discussed. Some practical and theoretical difficulties are addressed.< >
An inductive classification system that uses inductive learning techniques, namely, variations on J.R. Quinlan's (1986) ID3 system to produce a decision tree that can be used to distinguish between reusable and no...
详细信息
An inductive classification system that uses inductive learning techniques, namely, variations on J.R. Quinlan's (1986) ID3 system to produce a decision tree that can be used to distinguish between reusable and nonreusable code modules, is described. To accomplish that task, a set of high-level concepts used by software engineers to characterize structurally understandable code is identified. Each of these concepts is operationalized in terms of code complexity metrics that can be easily calculated during the compilation process. these metrices are related to various aspects of the program structure including its coupling, cohesion, data structure, control structure, and documentation. the decision tree produced for a sample of 81 Pascal programs outperformed similar classification efforts by a group of professional programmers.< >
the proceedings contain 16 papers. the special focus in this conference is on logicprogramming. the topics include: Legal expert system — Les-2;A prototype software simulator for FGHC;a foundation of reasoning by an...
ISBN:
(纸本)9783540180241
the proceedings contain 16 papers. the special focus in this conference is on logicprogramming. the topics include: Legal expert system — Les-2;A prototype software simulator for FGHC;a foundation of reasoning by analogy: Analogical union of logic programs;logic interface system on navigational database systems;programming in modal logic: An extension of PROLOG based on modal logic;On parallel programming methodology in GHC: Experience in programming a proof procedure of temporal logic;an optimizing Prolog compiler;A Prolog based object oriented language SPOOL and its compiler;development of C-Prolog compiler;a framework for interactive problem solving based on interactive query revision;Prolog computation model BPM and its debugger PROEDIT2;Fast execution mechanisms of parallel inference engine PIE: PIEpelined goal rewriting and goal multicasting;- FLENG Prolog - the language which turns supercomputers into parallel Prolog machines;foreword.
暂无评论