„Logic Programming“

Suchergebnisse

2.836 Treffer

• A Tree-based Mergesort
  Moffat, Alistair ; Petersson, Ola ; Wormald, Nicholas C.
• TeLEx: learning signal temporal logic from positive examples using tightness metric
  Jha, Susmit ; Tiwari, Ashish ; Seshia, Sanjit A. ; Sahai, Tuhin ; Shankar, Natarajan
• Opérations de cylindre et applications séquentielles gauches inverses
  Autebert, Jean-Michel
• Stepwise development of fair distributed systems
  Wabenhorst, Axel
• Extending stratified datalog to capture complexity classes ranging from ${\cal P} to {\cal QH}$
  Greco, Sergio ; Saccà, Domenico ; Zaniolo, Carlo
• Applying genetic improvement to a genetic programming library in C++
  López-López, Víctor R. ; Trujillo, Leonardo ; Legrand, Pierrick
• Performance preorder and competitive equivalence
  Corradini, Flavio ; Gorrieri, Roberto ; Roccetti, Marco
• Recursive Petri nets – Theory and application to discrete event systems
  Haddad, Serge ; Poitrenaud, Denis
• A construction of distributed reference counting
  Moreau, Luc ; Duprat, Jean
• The identity problem of finitely generated bi-ideals
  Lorencs, A.
• Generating trading rules on US Stock Market using strongly typed genetic programming
  Michell, Kevin ; Kristjanpoller, Werner
• Set abstraction—An extension of all solutions predicate in logic programming language
  Yokomori, Takashi
• Genetic programming with transfer learning for texture image classification
  Iqbal, Muhammad ; Al-Sahaf, Harith ; Xue, Bing ; Zhang, Mengjie
• Strong bisimilarity of simple process algebras: complexity lower bounds
  Srba, Jiří
• Demonic, angelic and unbounded probabilistic choices in sequential programs
  McIver, A.K ; Morgan, C.
• Structural operational semantics and bounded nondeterminism
  Fokkink, Wan ; Vu, Thuy Duong
• Polyhedral separation via difference of convex (DC) programming
  Astorino, Annabella ; Di Francesco, Massimo ; Gaudioso, Manlio ; Gorgone, Enrico ; Manca, Benedetto
• Alias analysis of pointers in Pascal and Fortran 90: dependence analysis between pointer references
  Matsumoto, Aki ; Han, D. S. ; Tsuda, Takao
• A polynomial time computable metric between point sets
  Ramon, Jan ; Bruynooghe, Maurice
• Expressiveness of component-based frameworks: a study of the expressiveness of BIP
  Baranov, Eduard ; Bliudze, Simon