TPLP Volume 14, 2014

• Introduction to the 30th International Conference on Logic Programming Special Issue.
  MICHAEL LEUSCHEL and TOM SCHRIJVERS. pp. 401-414.
• Dynamic Consistency Checking in Goal-Directed Answer Set Programming
  KYLE MARPLE and GOPAL GUPTA. pp 415 – 427
• Tabling, Rational Terms, and Coinduction Finally Together!
  THEOFRASTOS MANTADELIS, RICARDO ROCHA, and PAULO MOURA. pp 429 – 443
• Efficient Computation of the Well-Founded Semantics over Big Data
  ILIAS TACHMAZIDIS, GRIGORIS ANTONIOU, and WOLFGANG FABER, pp 445 – 459
• The P-Box CDF-Intervals: A Reliable Constraint Reasoning with Quantifiable Information
  AYA SAAD,THOM FRÜHWIRTH,and CARMEN GERVET, pp 461 – 475
• Simulating Dynamic Systems Using Linear Time Calculus Theories.
  BART BOGAERTS, JOACHIM JANSEN, MAURICE BRUYNOOGHE, BROES DE CAT, JOOST VENNEKENS, and MARC DENECKER. pp 477 – 492
• A Linear Logic Programming Language for Concurrent Programming over Graph Structures
  FLAVIO CRUZ, RICARDO ROCHA, SETH COPEN GOLDSTEIN,and FRANK PFENNING. pp 493 – 507
• SUNNY: a Lazy Portfolio Approach for Constraint Solving
  ROBERTO AMADINI, MAURIZIO GABBRIELLI,and JACOPO MAURO. pp 509 – 524
• Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R
  DANIEL GALL and THOM FRÜHWIRTH, pp 525 – 538
• Pengines: Web Logic Programming Made Easy
  TORBJÖRN LAGER and JAN WIELEMAKER. pp 539 – 552
• Incremental Tabling in Support of Knowledge Representation and Reasoning
  TERRANCE SWIFT. pp 553 – 567
• claspfolio 2: Advances in Algorithm Selection for Answer Set Programming
  HOLGER HOOS, MARIUS LINDAUER, and TORSTEN SCHAUB. pp 569 – 585
• Vicious Circle Principle and Logic Programs with Aggregates.
  MICHAEL GELFONDand YUANLIN ZHANG, pp 587 – 601
• Causal Graph Justifications of Logic Programs
  PEDRO CABALAR,JORGE FANDINNO, and MICHAEL FINK
  603 – 618
• On Termination, Confluence and Consistent CHR-based Type Inference
  GREGORY J. DUCK, RÉMY HAEMMERLÉ, and MARTIN SULZMANN. pp 619 – 632
• Contextual Abductive Reasoning with Side-Effects
  LUÍS MONIZ PEREIRA, EMMANUELLE-ANNA DIETZ, and STEFFEN HÖLLDOBLER
  pp 633 – 648
• A Proof Theoretic Study of Soft Concurrent Constraint Programming
  ELAINE PIMENTEL,CARLOS OLARTE, and VIVEK NIGAM
  pp 649 – 663
• A Measure of Arbitrariness in Abductive Explanations
  LUCIANO CAROPRESE, IRINA TRUBITSYNA, Mirosław Truszczyński, and Ester Zumpano. pp 665 – 679
• Lifted Variable Elimination for Probabilistic Logic Programming
  ELENA BELLODI, EVELINA LAMMA, FABRIZIO RIGUZZI, VITOR SANTOS COSTA, and RICCARDO ZESE
  pp 681 – 695
• Using Tabled Logic Programming to Solve the Petrobras Planning Problem
  ROMAN BARTÁK and NENG-FA ZHOU, pp 697 – 710
• On Cascade Products of Answer Set Programs
  CHRISTIAN ANTIĆ, pp 711 – 723.
• Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
  ANGELOS CHARALAMBIDIS,ZOLTÁN ÉSIK, and PANOS RONDOGIANNIS. pp 725 – 737
• Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types
  A. SERRANO,P. LOPEZ-GARCIA, and M. V. HERMENEGILDO. pp 739 – 754
• Anytime Computation of Cautious Consequences in Answer Set Programming
  MARIO ALVIANO,CARMINE DODARO, and FRANCESCO RICCA, pp 755-770.
• A Module System for Domain-Specific Languages
  ETHAN K. JACKSON, pp 771-785
• Abstract Diagnosis for tccp using a Linear Temporal Logic
  MARCO COMINI,LAURA TITOLO, and ALICIA VILLANUEVA, pp 787-801.

TECHNICAL COMMUNICATIONS

• Properties of Stable Model Semantics Extensions. Mario Abrantes and Luıs Moniz Pereira. pp 1-16
• A Simple and Efficient Lock-Free Hash Trie Design for Concurrent Tabling. Miguel Areias and Ricardo Rocha. pp 17-26
• Grounding Bound Founded Answer Set Programs Rehan Abdul Aziz, Geoffrey Chu and Peter J. Stuckey. pp 27-39
• Towards an ASP-Based Architecture for Autonomous UAVs in Dynamic Environments. Marcello Balduccini, William Regli and Duc Nguyen. pp 40-49
• A Well-Founded Semantics for FOL-Programs. Yi Bi, Jia-Huai You and Zhiyong Feng. pp 50-59
• FO(C): A Knowledge Representation Language of Causality. Bart Bogaerts, Joost Vennekens, Marc Denecker and Jan Van den Bussche. pp 60-69
• A Framework for Bottom-Up Simulation of SLD-Resolution. Stefan Brass. pp 70-79
• Customisable Handling of Java References in Prolog Programs. Sergio Castro, Kim Mens and Paulo Moura. pp 80-89
• Analysis and Transformation Tools for Constrained Horn Clause Verification. John P. Gallagher and Bishoksan Kafle. pp 90-101
• Multi-criteria optimal planning for Energy policies in CLP. Marco Gavanelli, Michela Milano, Stefano Bragaglia, Federico Chesani, Elisa Marengo and Paolo Cagnoli. pp 102-111
• Clingo = ASP + Control: Preliminary Report. Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten Schaub. pp 112-120.
• Transaction Logic with (Complex) Events. Ana Sofia Gomes and Jose Julio Alferes. pp 121-131
• Coinductive Logic Programming: Eager vs Lazy. Jonathan Heras, Ekaterina Komendantskaya and Martin Schmidt. pp 132-141
• Logic and Constraint Logic Programming for Distributed Constraint Optimization.  Tiep Le, Enrico Pontelli, Tran Cao Son and William Yeoh. pp 142-153
• Adaptive MCMC-Based Inference in Probabilistic Logic Programs. Arun Nampally and C. R. Ramakrishnan. pp 154-163
• Propagation Properties of Min-closed CSPs. G. Narboni. pp 164-174
• Towards an Efficient Prolog System by Code Introspection. George Souza Oliveira and Anderson Faustino Da Silva. pp 175-184
• Joint Tabling of Logic Program Abductions and Updates. Ari Saptawijaya and Luis Moniz Pereira. pp 185-196
•  On Strong and Default Negation in Answer-Set Program Updates. Martin Slota, Martin Balaz and Joao Leite. pp 197-208.
• Towards Assertion-based Debugging of Higher-Order (C)LP Programs. Nataliia Stulova, Jose F. Morales and Manuel V. Hermenegildo. pp 209-210
• Interclausal Logic Variables. Paul Tarau and Fahmida Hamid. pp 211-220.
• ESmodels: An Epistemic Specification Solver. Zhizheng Zhang and Kaikai Zhao. pp 221-230

DOCTORAL CONSORTIUM PAPERS

• Bound Founded Answer Set Programming. Rehan Abdul Aziz.
• Model Revision Inference for Extensions of First Order Logic. Joachim Jansen.
• Logic Programming as Scripting Language for Bots in Computer Games – Research Overview.  Grzegorz Jaśkiewicz.
• The Impact of Disjunction on Reasoning under Existential Rules: Research Summary. Michael Morak
• CDF-Intervals: A Reliable Framework to Reason about Data with Uncertainty.
  Aya Saad.
• Visualization of Constraint Handling Rules. Nada Sharaf.
• Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic Programs. Heike Stephan.
• Reasoning with Probabilistic Logics. Riccardo Zese.