Theory and Practice of Logic Programming (TPLP), Volume 10

Volume 10, Number 1, January 2010

• Jon Sneyers, Peter Van Weert, Tom Schrijvers, Leslie De Koninck:
  As time goes by: Constraint Handling Rules. 1-47
  
• Gianluca Amato, Francesca Scozzari:
  On the interaction between sharing and linearity. 49-112
  

• Fabio Fassetti, Luigi Palopoli:
  On the complexity of identifying head-elementary-set-free programs. 113-123
  

Volume 10, Number 2, March 2010

• Sergio Greco, Cristian Molinaro, Irina Trubitsyna, Ester Zumpano:
  NP Datalog: A logic language for expressing search and optimization problems. 125-166
  
• Agostino Dovier, Andrea Formisano, Enrico Pontelli:
  Multivalued action languages with constraints in CLP(FD). 167-235
  

• Jeremy Avigad:
  Handbook of Practical Logic and Automated Reasoning, John Harrison, Cambridge University Press, 2009. Hardcover, ISBN-13: 978-0-521-89957-4, 681 pp. + xix, $135.00. 237-241
  

Volume 10, Number 3, May 2010

• Giorgio Orsi, Letizia Tanca:
  Introduction to the TPLP special issue, logic programming in databases: From Datalog to semantic-web rules. 243-250
  
• Joanna Józefowska, Agnieszka Lawrynowicz, Tomasz Lukaszewski:
  The role of semantics in mining frequent patterns from knowledge bases in description logics with rules. 251-289
  
• Andrea Calì, Davide Martinenghi:
  Querying incomplete data over extended ER schemata. 291-329
  
• Francesca A. Lisi:
  Inductive Logic Programming in Databases: From Datalog to DL+log. 331-359
  

Volume 10, Numbers 4-6, July 2010

• Manuel V. Hermenegildo, Torsten Schaub:
  Introduction to the 26th international conference on logic programming special issue. 361-364
  
• Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann:
  Automated termination analysis for logic programs with cut. 365-381
  
• Alberto Pettorossi, Valerio Senni, Maurizio Proietti:
  Transformations of logic programs on infinite lists. 383-399
  
• Pablo Chico de Guzmán, Manuel Carro, David Scott Warren:
  Swapping evaluation: A memory-scalable solution for answer-on-demand tabling. 401-416
  
• Vítor Santos Costa, Inês de Castro Dutra, Ricardo Rocha:
  Threads and or-parallelism unified. 417-432
  
• Jon Sneyers, Wannes Meert, Joost Vennekens, Yoshitaka Kameya, Taisuke Sato:
  CHR(PRISM)-based probabilistic logic learning. 433-447
  
• Henning Christiansen, Christian Theil Have, Ole Torp Lassen, Matthieu Petit:
  Inference with constrained hidden Markov models in PRISM. 449-464
  
• Christian Drescher, Toby Walsh:
  A translational approach to constraint answer set solving. 465-480
  
• Sabrina Baselice, Piero A. Bonatti:
  A decidable subclass of finitary programs. 481-496
  
• Mario Alviano, Wolfgang Faber, Nicola Leone:
  Disjunctive ASP with functions: Decidable queries and effective computation. 497-512
  
• Johannes Oetsch, Jörg Pührer, Hans Tompits:
  Catching the Ouroboros: On debugging non-ground answer-set programs. 513-529
  
• Yisong Wang, Jia-Huai You, Li-Yan Yuan, Yi-Dong Shen:
  Loop formulas for description logic programs. 531-545
  
• Martin Slota, João Leite:
  Towards closed world reasoning in dynamic open worlds. 547-563
  
• James P. Delgrande:
  A program-level approach to revising logic programs under the answer set semantics. 565-580
  
• Ping Hou, Broes de Cat, Marc Denecker:
  FO(FD): Extending classical logic with rule-based fixpoint definitions. 581-596
  
• Hariolf Betz, Frank Raiser, Thom W. Frühwirth:
  A complete and terminating execution model for Constraint Handling Rules. 597-610
  
• Maurizio Gabbrielli, Jacopo Mauro, Maria Chiara Meo, Jon Sneyers:
  Decidability properties for fragments of CHR. 611-626
  
• Mario Rodríguez-Artalejo, Carlos A. Romero-Díaz:
  A declarative semantics for CLP with qualification and proximity. 627-642
  
• Marco Gavanelli, Fabrizio Riguzzi, Michela Milano, Paolo Cagnoli:
  Logic-based decision support for strategic environmental assessment. 643-658
  
• Miguel Gómez-Zamalloa, Elvira Albert, Germán Puebla:
  Test case generation for object-oriented imperative languages in CLP. 659-674
  
• Chitta Baral, Gregory Gelfond, Enrico Pontelli, Tran Cao Son:
  Logic programming for finding models in the logics of knowledge and its applications: A case study. 675-690
  
• Nuno P. Lopes, Juan Antonio Navarro Pérez, Andrey Rybalchenko, Atul Singh:
  Applying Prolog to develop distributed systems. 691-707
  
• Alessandro Dal Palù, Agostino Dovier, Federico Fogolari, Enrico Pontelli:
  CLP-based protein fragment assembly. 709-724
  
• Marcello Balduccini, Sara Girotto:
  Formalization of psychological knowledge in answer set programming and its application. 725-740
  
• Robert Brummayer, Matti Järvisalo:
  Testing and debugging techniques for answer set solver development. 741-758
  
• Johannes Oetsch, Jörg Pührer, Martin Schwengerer, Hans Tompits:
  The system Kato: Detecting cases of plagiarism for answer-set programs. 759-775
  

Last update Fri May 24 20:57:41 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page