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

Volume 9, Number 1, January 2009

• Enrico Pontelli, Tran Cao Son, Omar El-Khatib:
  Justifications for logic programs under answer set semantics. 1-56
  
• Chitta Baral, Michael Gelfond, J. Nelson Rushton:
  Probabilistic reasoning with answer sets. 57-144
  

Volume 9, Number 2, March 2009

• Étienne Payet, Frédéric Mesnard:
  A non-termination criterion for binary constraint logic programs. 145-164
  
• Leslie De Koninck:
  Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities. 165-212
  
• Sabrina Baselice, Piero A. Bonatti, Giovanni Criscuolo:
  On finitely recursive programs. 213-238
  
• Femke van Raamsdonk:
  Lambda-Calculus and Combinators, An Introduction, 2nd Edition, J. Roger Hindley and Jonathan P. Seldin, Cambridge University Press, 2008. Hardback, ISBN 9780521898850. 239-243
  

Volume 9, Number 3, May 2009

• Joost Vennekens, Marc Denecker, Maurice Bruynooghe:
  CP-logic: A language of causal probabilistic events and its relation to logic programming. 245-308
  
• Van Hung Le, Fei Liu, Dinh Khang Tran:
  Fuzzy linguistic logic programming and its applications. 309-341
  
• Gergely Lukácsy, Péter Szeredi:
  Efficient description logic reasoning in Prolog: The DLog system. 343-414
  

Volume 9, Number 4, July 2009

• Sonia Estévez Martín, Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo, Rafael del Vado Vírseda, Fernando Sáenz-Pérez, Antonio J. Fernández:
  On the cooperation of the constraint domains , R, and F in CFLP. 415-527
  
• Yi-Dong Shen, Jia-Huai You, Li-Yan Yuan:
  Characterizations of stable model semantics for logic programs with arbitrary constraint atoms. 529-564
  

Volume 9, Number 5, September 2009

• David Pearce, Hans Tompits, Stefan Woltran:
  Characterising equilibrium logic and nested logic programs: Reductions and complexity^, . 565-616
  
• Gianluca Amato, Francesca Scozzari:
  Optimality in goal-dependent analysis of Sharing. 617-689
  

Volume 9, Number 6, November 2009

• Paolo Mancarella, Giacomo Terreni, Fariba Sadri, Francesca Toni, Ulle Endriss:
  The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments. 691-750
  
• Yi-Dong Shen, Danny De Schreye, Dean Voets:
  Termination prediction for general logic programs. 751-780
  
• Miroslaw Truszczynski, Stefan Woltran:
  Relativized hyperequivalence of logic programs for modular programming. 781-819
  

Last update Tue Feb 14 04:23:50 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page