„Logic Programming“

Suchergebnisse

2.836 Treffer

• n-PS-codes, 2-infix-outfix codes and some related classes of codes
  Liu, Haiyan ; Cui, Rongdong ; Zhang, Tianjie
• Balancing m-ary search trees with compressions on the fringe
  Gao, Shuyang ; Hatem, Leen ; Mahmoud, Hosam
• Optimization of a subclass of conjunctive queries
  Biskup, Joachim ; Dublish, Pratul ; Sagiv, Yehoshua
• Petri net algorithms in the theory of matrix grammars
  Hauschildt, Dirk ; Jantzen, Matthias
• Modularity and reusability in attribute grammars
  Kastens, Uwe ; Waite, W. M.
• Reexecution in abstract interpretation of Prolog
  Le Charlier, Baudouin ; Hentenryck, Pascal Van
• On the Hotz group of a context-free grammar
  Frougny, Christiane ; Sakarovitch, Jacques ; Valkema, Erich
• On termination problems for finitely interpreted ALGOL-like programs
  Langmaack, Hans
• Partial abstract types
  Broy, Manfred ; Wirsing, Martin
• Describing semantic domains with sprouts
  Schmidt, Gunther ; Berghammer, Rudolf ; Zierer, Hans
• Free choice systems have home states
  Best, Eike ; Voss, Klaus
• A formal model of atomicity in asynchronous systems
  Best, Eike ; Randell, Brian
• A new data structure for representing sorted lists
  Huddleston, Scott ; Mehlhorn, Kurt
• The residue of vector sets with applications to decidability problems in Petri nets
  Valk, Rüdiger ; Jantzen, Matthias
• Purely top-down updating algorithms for stratified search trees
  Ottmann, Thomas ; Schrapp, Michael ; Wood, Derick
• Top-down syntax analysis
  Knuth, Donald Ervin
• Boolesche Minimalpolynome und Überdeckungsprobleme
  Paul, Wolfgang J.
• Algorithms for routing in planar graphs
  Becker, M. ; Mehlhorn, Kurt
• Fast algorithms for the elimination of common subexpressions
  Ullman, Jeffrey D.
• On generators and generative capacity of EOL forms
  Maurer, Hermann ; Salomaa, Arto ; Wood, D.