Logic programming : formal methods and practical applications
著者
書誌事項
Logic programming : formal methods and practical applications
(Studies in computer science and artificial intelligence, 11)
Elsevier, 1995
大学図書館所蔵 全21件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references
内容説明・目次
内容説明
There is growing evidence of a convergence between the technical challenges of developing advanced software systems on the one hand, and the formal techniques, tools and features evolving from the logic programming paradigm on the other. This book aims at promoting such convergence. It provides contributions towards different aspects of logic programming, which are relevant to the development of complex and reliable software systems and describes a number of advanced applications. The papers are organized around four main themes: Foundations; Languages Aspects and Methodology; Constraints; and Applications. The publication closes with an outlook on the challenges and opportunities lying ahead in the field of logic programming.
目次
- Part 1 Foundations: goal-directed forward chaining - a tuple-oriented bottom-up approach, W. Burgard
- from magic sets to a tuple-oriented approach
- comparing magic sets and goal-directed forward chaining
- computing relevant atoms
- GDFC-resolution
- termination of GDFC-resolution
- efficiency of GDFC-resolution
- the WAM - definition and compiler correctness, E. Borger and D. Rosenzweig
- evolving algebras
- prolog - tree and stack models
- predicate structure
- clause structure
- term structure. Appendices: rules for prolog tree model
- rules for compiled predicate structure
- rules for compiled clause structure
- rules for the WAM
- automatic verification of parallel logic programs - termination, L. Plumer
- basic notions
- directed programs and oriented derivations
- well-formed programs
- program transformation
- automatic termination proofs
- derivation of linear predicate inequalities for well-formed programs
- final remarks. Part 2 Language aspects and methodology: logic program modules for interoperable information systems, A.B. Cremers et al
- interoperability
- EPSILON
- building interoperable systems with links
- concepts, implementation, and applications of a typed logic programming language, C. Beierle
- concepts of PROTOS-L
- the PROTOS-L system
- planning applications
- further work
- polymorphic feature types, G. Meyer
- types and subtyping
- typed logic programming
- parametric polymorphism and feature types
- formal aspects
- further work
- efficient object-oriented programming in prolog, P. Schachte and G. Saab
- the objects package - a precursor to classes
- the second version - the classes package
- implementation of classes
- results
- examples
- future work
- related work. Part 3 Constraints: combinatorial problem solving in constraint logic programming with cooperating solvers, H. Beringer and B. De Backer
- a primer to constraint logic programming
- using CLP as a tool for combinatorial problem solving
- the domain reduction solver
- the real linear solver
- making the different solvers communicate
- using constraint logic programming for industrial scheduling problems, S. Breitinger and H.C.R. Lock
- constraints in scheduling problems
- disjunctive constraints
- heuristics - a guide to search
- related work. Part 4 Applications: a generic scheduling framework developed in prolog, L. Sterling and V. Srinivasan
- the scheduling problem - a generic solution
- specification of scheduler clusters
- schedule generation
- evaluation of experiments
- scheduling and meta-scheduling, J. Sauer
- the scheduling problem
- scheduling in PROTOS
- meta-scheduling
- dynamic and meta-scheduling knowledge
- representation of scheduling knowledge by heuristics
- META_PLAN - using dynamic scheduling knowledge
- robot control systems as contextual logic programs, E. Denti et al
- contextual logic programming systems
- the CARA robot programming support. (Part contents).
「Nielsen BookData」 より