ICLP 2013 - 29. International Conference on Logic Programming

List of Accepted Papers

Broes De Cat and Maurice Bruynooghe. Detection and Exploitation of Functional Dependencies For Model Generation

Rolf Schwitter. The Jobs Puzzle: Taking on the Challange via Controlled Natural Language Processing

Vladimir Lifschitz and Fangkai Yang. Lloyd-Topor Completion and General Stable Models

Rehan Aziz, Geoffrey Chu and Peter Stuckey. Stable Model Semantics for Founded Bounds

Tom Schrijvers, Bart Demoen, Benoit Desouter and Jan Wielemaker. Delimited Continuations for Prolog

Marcello Balduccini. ASP with non-Herbrand Partial Functions: a Language and System for Practical Use

Jia-Huai You, Heng Zhang and Yan Zhang. Disjunctive Logic Programs with Existential Quantification in Rule Heads

Michael Maher. Relative Expressiveness of Defeasible Logics II

Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Sondergaard and Peter J. Stuckey. Failure Tabled Constraint Logic Programming by Interpolation

Mirjana Mazuran, Edoardo Serra and Carlo Zaniolo. A Declarative Extension of Horn Clauses, and its Significance for Datalog and its Applications

Alejandro Arbelaez, Philippe Codognet and Charlotte Truchet. Using Runtime Distributions for the Analysis and Parallelization of Local Search for SAT

Laura Giordano, Alberto Martelli, Matteo Spiotta and Daniele Theseider Dupre'. Business Process Verification with Constraint Temporal Answer Set Programming

Paula-Andra Busoniu, Johannes Oetsch, Jörg Pührer, Peter Skočovský and Hans Tompits. SeaLion: An Eclipse-based IDE for Answer-Set Programming with Advanced Debugging Support

Roland Kaminski, Torsten Schaub, Anne Siegel and Santiago Videla. Minimal Intervention Strategies in Logical Signaling Networks with Answer Set Programming

Joachim Jansen, Gerda Janssens and Albert Jorissen. Compiling Input∗ FO(·) Inductive Definitions into Tabled Prolog Rules for IDP3

Senlin Liang and Michael Kifer. A Practical Analysis of Non-Termination in Large Logic Programs

Elvira Albert, Maria Garcia de La Banda, Miguel Gomez-Zamalloa, José Miguel Rojas and Peter Stuckey. A CLP Heap Solver for Test Case Generation

Sergio Greco, Cristian Molinaro and Irina Trubitsyna. Logic Programming with Function Symbols: Checking Termination of Bottom-up Evaluation Through Program Adornments

Mario Alviano and Rafael Peñaloza. Fuzzy answer sets approximations

Jon Sneyers, Daniel De Schreye and Thom Fruehwirth. Probabilistic Legal Reasoning in CHRiSM

Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, Katsumi Inoue and Torsten Schaub. Answer Set Programming as a Modeling Language for Course Timetabling

Vítor Santos Costa and David Vaz. BigYAP: Exo-compilation meets UDI

Jiefei Ma, Frank Le, David Wood, Alessandra Russo and Jorge Lobo. A declarative approach for distributed computing: specification, execution and analysis

Esra Erdem, Volkan Patoglu, Zeynep Gozen Saribatur, Peter Schüller and Tansel Uras. Finding Optimal Plans for Multiple Teams of Robots through a Mediator: A Logic-Based Approach

Paul Tarau. Compact Serialization of Prolog Terms (with Catalan Skeletons, Cantor Tupling and Goedel Numberings)

Michael Bartholomew and Joohyung Lee. On the Stable Model Semantics with Intensional Functions

Georg Gottlob, Marco Manna and Andreas Pieris. Combining Decidability Paradigms for Existential Rules

PAGE MENU