TPLP Volume 17, 2017

Volume 17, 2017

Please use the TPLP citation in your papers, not the Axiv/corr one!

ISSUE 01, JANUARY 2017

• The pragmatic proof: hypermedia API composition and execution.
  Ruben Verborgh, Dörthe Arndt, Sofie Van Hoecke, Jos De Roo, Giovanni Mels, Thomas Steiner, Joaquim Gabarro, pp. 1-48
• Enablers and Inhibitors in Causal Justifications of Logic Programs Authors: Pedro Cabalar and Jorge Fandinno, pp. 49-74
• Range-based argumentation semantics as 2-valued models. Mauricio Osorio, Juan Carlos Nieves, pp. 75-90.
• The KB paradigm and its application to interactive configuration. Pieter Van Hertum, Ingmar Dasseville, Gerda Janssens, Marc Denecker, pp.  91-117 [TN/RPP]
• BOOK REVIEW by ROMAN BARTÁK: Constraint Solving and Planning with Picat by Neng-Fa Zhou , Håkan Kjellerstrand , and Jonathan Fruhman. Springer, 2015.

 

ISSUE 02, MARCH 2017

• Default rules for Curry. Sergio Antoy and Michael Hanus, pp. 121-147. [TN/RPP]
• Consistency and Trust in Peer Data Exchange Systems. Leopoldo Bertossi and Loreto Bravo, pp. 148-204.
• Non-monotonic spatial reasoning with Answer Set Programming Modulo Theories. Przemyslaw Andrzej Walega, Carl Schultz, Mehul Bhatt, pp. 205-225 [TN/RPP]
• Temporal Logic Programs with Variables. Felicidad Aguado, Pedro Cabalar,
  Martín Diéguez, Gilberto Perez, pp. 226-243.

 

ISSUE 03, MAY 2017

• A Linear Algebraic Approach to Datalog Evaluation
  Taisuke Sato SATO. pp 244-265
• ASPeRiX, a First Order Forward Chaining Approach for Answer Set Computing
  Claire Lefèvre, Christopher Bèatrix, Igor Stèphan and Laurent Garcia. pp 266-310
• αCheck: a mechanized metatheory model-checker
  James Cheney and Alberto Momigliano. pp 311-352
• BOOK REVIEW BY KRZYSZTOF R. APT: Computation, Proof, Machine: Mathematics Enters a New Age, Gilles Dowek, Cambridge University Press, 2015. pp. 353-358

 

ISSUE 04, JULY 2017

Special issue on New Trends of Constraint Logic Programming

• PREFACE By Agostino Dovier. pp. 359-364.
• Contractibility for Open Global Constraints.
  Michael J. Maher. pp. 365-407.
  
• Clingcon: The Next Generation. 
  Mutsunori Banbara, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub. pp. 408-461
• Constraint Answer Set Solver EZCSP and Why Integration Schemas Matter. 
  Marcello Balduccini and Yuliya Lierler. pp. 462-515
• Constraint Solving for Finite Model Finding in SMT Solvers 
  Andrew Reynolds, Cesare Tinelli, Clark Barrett. pp. 516-558
• On Relation between Constraint Answer Set Programming and Satisfiability Modulo Theories.
  Yuliya Lierler, Benjamin Susman. pp. 559-590.
• CASP Solutions for Planning in Hybrid Domains.
  Marcello Balduccini, Daniele Magazzeni, Marco Maratea, Emily LeBlanc. pp. 591-633
• Solving Distributed Constraint Optimization Problems Using Logic Programming. 
  Tiep Le, Tran Cao Son, Enrico Pontelli, William Yeoh. pp. 634-683.

 

ISSUE 05-06, SEPTEMBER 2017

Special issue on 33rd International Conference on Logic Programming

• Introduction to the 33rd international conference on logic programming special issue
  RICARDO ROCHA, TRAN CAO SON, pp. 684-688
• Inspecting Maude variants with GLINTS
  M. ALPUENTE, S. ESCOBAR, J. SAPIÑA, A. CUENCA-ORTEGA, pp. 689-707
• Model enumeration in propositional circumscription via unsatisfiable core analysis
  MARIO ALVIANO, pp. 708-725
• Finite model reasoning over existential rules
  GIOVANNI AMENDOLA, NICOLA LEONE, MARCO MANNA, pp. 726-743
• Ticker: A system for incremental ASP-based stream reasoning
  HARALD BECK, THOMAS EITER, CHRISTIAN FOLIE, pp. 744-763
• Improving adherence to heart failure management guidelines via abductive reasoning
  ZHUO CHEN, ELMER SALAZAR, KYLE MARPLE, GOPAL GUPTA, LAKSHMAN TAMIL, DANIEL CHEERAN, SANDEEP DAS, ALPESH AMIN, pp. 764-779
• Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis
  BERNARDO CUTERI, CARMINE DODARO, FRANCESCO RICCA, PETER SCHÜLLER, pp. 780-799
• Logic programming approaches for routing fault-free and maximally parallel wavelength-routed optical networks-on-chip (Application paper)
  MARCO GAVANELLI, MADDALENA NONATO, ANDREA PEANO, DAVIDE BERTOZZI, pp. 800-818
• Annotated defeasible logic
  GUIDO GOVERNATORI, MICHAEL J. MAHER, pp. 819-836
• When you must forget: Beyond strong persistence when forgetting in answer set programming
  RICARDO GONÇALVES, MATTHIAS KNORR, JOÃO LEITE, STEFAN WOLTRAN, pp. 837-854
• Program completion in the input language of GRINGO
  AMELIA HARRISON, VLADIMIR LIFSCHITZ, DHANANJAY RAJU, pp. 855-871
• Clingo goes linear constraints over reals and integers
  TOMI JANHUNEN, ROLAND KAMINSKI, MAX OSTROWSKI, SEBASTIAN SCHELLHORN, PHILIPP WANKO, TORSTEN SCHAUB, pp. 872-888
• Well-founded operators for normal hybrid MKNF knowledge bases
  JIANMIN JI, FANGFANG LIU, JIA-HUAI YOU, pp. 889-905
• Productive corecursion in logic programming
  EKATERINA KOMENDANTSKAYA, YUE LI, pp. 906-923
• Representing hybrid automata by action language modulo theories
  JOOHYUNG LEE, NIKHIL LONEY, YUNSONG MENG, pp. 924-941
• Computing LPMLN using ASP and MLN solvers
  JOOHYUNG LEE, SAMIDH TALSANIA, YI WANG, pp. 942-960
• Achievements in answer set programming
  VLADIMIR LIFSCHITZ, pp. 961-973
• The intricacies of three-valued extensional semantics for higher-order logic programs
  PANOS RONDOGIANNIS, IOANNA SYMEONIDOU, pp. 974-991
• Constraint handling rules with binders, patterns and generic quantification
  ALEJANDRO SERRANO, JURRIAAN HAGE, pp. 992-1009
• A new algorithm to automate inductive learning of default theories
  FARHAD SHAKERIN, ELMER SALAZAR, GOPAL GUPTA, pp. 1010-1026
• Hybrid conditional planning using answer set programming
  IBRAHIM FARUK YALCINER, AHMED NOUMAN, VOLKAN PATOGLU, ESRA ERDEM, pp. 1027-1047
• Fixpoint semantics and optimization of recursive Datalog programs with aggregates
  CARLO ZANIOLO, MOHAN YANG, ARIYAM DAS, ALEXANDER SHKAPSKY, TYSON CONDIE, MATTEO INTERLANDI, pp. 1048-1065