Introduction to the 28th International Conference on Logic Programming Special Issue

We are proud to introduce this special issue of the Journal of Theory and Practice of Logic Programming (TPLP), dedicated to the full papers accepted for the 28th International Conference on Logic Programming (ICLP). The ICLP meetings started in Marseille in 1982 and since then constitute the main venue for presenting and discussing work in the area of logic programming.



There are no comments yet.


page 1

page 2

page 3

page 4


Introduction to the 35th International Conference on Logic Programming Special Issue

We are proud to introduce this special issue of Theory and Practice of L...

Pre-proceedings of the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018)

This volume constitutes the pre-proceedings of the 28th International Sy...

A farewell to Professor RNDr. Věra Trnková, DrSc

This is an introduction of the volume of the journal Commentationes Math...

Proceedings Seventh International Workshop on Classical Logic and Computation

This special issue cover the seventh and last conference of the CL&C ser...

Editorial introduction: The power of words and networks

According to Freud "words were originally magic and to this day words ha...

Model revision inference for extensions of first order logic

I am Joachim Jansen and this is my research summary, part of my applicat...

Proceedings of the 10th International Conference on Non-Classical Logics. Theory and Applications

Non-Classical Logics. Theory and Applications (NCL) is an international ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

Position Paper

Simulation Unification: Beyond Querying Semistructured Data
     François Bry, Sebastian Schaffert

Technical Communication

A Logic Programming approach for Access Control over RDF
     Nuno Lopes, Sabrina Kirrane, Antoine Zimmermann, Axel Polleres and Alessandra Mileo

Modeling Machine Learning and Data Mining Problems with FO(

     Hendrik Blockeel, Bart Bogaerts, Maurice Bruynooghe, Broes De Cat, Stef De Pooter, Marc Denecker, Anthony Labarre, Jan Ramon and Sicco Verwer.

Paving the Way for Temporal Grounding
     Felicidad Aguado, Pedro Cabalar, Martín Diéguez, Gilberto Pérez and Concepcion Vidal.

Preprocessing of Complex Non-Ground Rules in Answer Set Programming
     Michael Morak and Stefan Woltran.

Two-Valued Logic Programs
     Vladimir Lifschitz.

LOG-IDEAH: ASP for Architectonic Asset Preservation
     Marina De Vos, Julian Padget, Vivana Novelli and Dina D’Ayala.

aspeed: ASP-based Solver Scheduling
     Holger Hoos, Roland Kaminski, Torsten Schaub and Marius Schneider.

Static Type Inference for the Q language using Constraint Logic Programming
     Zsolt Zombori, János Csorba and Péter Szeredi.

ASP at Work: An ASP Implementation of PhyloWS
     Enrico Pontelli, Tiep Le, Hieu Nguyen and Tran Cao Son.

Improving Quality and Efficiency in Home Health Care: an application of Constraint Logic Programming for the Ferrara NHS unit
     Massimiliano Cattafi, Rosa Herrero, Marco Gavanelli, Maddalena Nonato and Juan José Ramos Gonzalez.

An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions
     Johannes Oetsch, Jörg Pührer and Hans Tompits.

A Tarskian Semantics for Answer Set Programming
     Marc Denecker, Yuliya Lierler, Mirek Truszczynski and Joost Vennekens.

Lazy model expansion by incremental grounding
     Broes De Cat, Marc Denecker and Peter Stuckey.

Logic + control: An example
     Włodek Drabent.

Tabling for infinite probability computation

     Taisuke Sato and Philipp Meyer.

Improving Lazy Non-Deterministic Computations by Demand Analysis
     Michael Hanus.

Surviving Solver Sensitivity: An ASP Practitioner’s Guide
     Bryan Silverthorn, Yuliya Lierler and Marius Schneider.

On the Termination of Logic Programs with Function Symbols
     Sergio Greco, Francesca Spezzano and Irina Trubitsyna.

Towards Testing Concurrent Objects in CLP
     Elvira Albert, Puri Arenas and Miguel Gomez-Zamalloa.

Generating Event-Sequence Test Cases by Answer SetProgramming with the Incidence Matrix
     Mutsunori Banbara, Naoyuki Tamura and Katsumi Inoue.

Answer Set Solving with Lazy Nogood Generation
     Christian Drescher and Toby Walsh.

Reconciling Well-Founded Semantics of DL-Programs and AggregatePrograms
     Jia-Huai You, John Morris and Yi Bi.

Stable Models of Formulas with Generalized Quantifiers
     Joohyung Lee and Yunsong Meng.

Extending C+ with Composite Actions for Robotic Task Planning
     Xiaoping Chen, Guoqiang Jin and Fangkai Yang.

Deriving a Fast Inverse of the Generalized Cantor N-tupling Bijection
     Paul Tarau.

Unsatisfiability-based optimization in clasp
     Benjamin Andres, Benjamin Kaufmann, Oliver Matheis and Torsten Schaub.

Visualization of Constraint Handling Rules through Source-to-Source Transformation
     Slim Abdennadher and Nada Sharaf.

Applying Machine Learning Techniques to ASP Solving
     Marco Maratea, Luca Pulina and Francesco Ricca.

Flexible Solvers for Finite Arithmetic Circuits
     Nathaniel Filardo and Jason Eisner.

The additional difficulties for the automatic synthesis of specifications posed by logic features in functional-logic languages
     Giovanni Bacci, Marco Comini, Marco A. Feliú and Alicia Villanueva.

Answering Why and How questions with respect to a frame-based knowledge base: a preliminary report
     Shanshan Liang, Nguyen Ha Vo and Chitta Baral.

Logic Programming in Tabular Allegories
     Emilio Jesús Gallego Arias and James B. Lipton.

Possibilistic Nested Logic Programs
     Juan Carlos Nieves and Helena Lindgren.

Using Answer Set Programming in the Development of Verified Software
     Florian Schanda and Martin Brain.

An Answer Set Solver for non-Herbrand Programs: Progress Report
     Marcello Balduccini.

CHR for Social Responsibility
     Veronica Dahl, Bradley Coleman, Emilio Miralles and Erez Maharshak.

A Concurrent Operational Semantics for Constraint Functional Logic Programming
     Rafael Del Vado Vírseda, Fernando Pérez Morente and Marcos Miguel García Toledo.

Doctoral Consortium Contributions

Software Model Checking by Program Specialization
     Emanuele De Angelis

Temporal Answer Set Programming
     Martín Diéguez

A Gradual Polymorphic Type System with Subtyping for Prolog
     Spyros Hadjichristodoulou

ASP modulo CSP: The clingcon system
     Max Ostrowski

An ASP Approach for the Optimal Placement of the Isolation Valves in a Water Distribution System
     Andrea Peano

Answer Set Programming with External Sources
     Christoph Redl

Together, Is Anything Possible? A Look at Collective Commitments for Agents
     Ben Wright