Table of Contents

• The Life of a Logic Programming SystemVítor Santos Costa. 1-6 [doi]
• Uniting the Prolog CommunityTom Schrijvers, Bart Demoen. 7-8 [doi]
• Constraint Handling RulesTom Schrijvers. 9-10 [doi]
• Back to Interval Temporal LogicsAngelo Montanari. 11-13 [doi]
• Systems Biology: Models and LogicsCarla Piazza, Alberto Policriti. 14 [doi]
• Separation Logic TutorialPeter W. O Hearn. 15-21 [doi]
• Authorization and Obligation Policies in Dynamic SystemsMichael Gelfond, Jorge Lobo. 22-36 [doi]
• Twelve Definitions of a Stable ModelVladimir Lifschitz. 37-51 [doi]
• Sixty Years of Stable ModelsDavid Pearce. 52 [doi]
• The DLV Project: A Tour from Theory and Research to Applications and MarketNicola Leone, Wolfgang Faber. 53-68 [doi]
• Using Answer Set Programming for Knowledge Representation and Reasoning: Future DirectionsChitta Baral. 69-70 [doi]
• Building a Knowledge Base System for an Integration of Logic Programming and Classical LogicMarc Denecker, Joost Vennekens. 71-76 [doi]
• SMS and ASP: Hype or TST?Thomas Eiter. 77-82 [doi]
• Quo Vadis Answer Set Programming?Victor W. Marek. 83-87 [doi]
• Answer Set Programming without Unstratified NegationIlkka Niemelä. 88-92 [doi]
• Here s the Beef: Answer Set Programming !Torsten Schaub. 93-98 [doi]
• Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-ThereMichael Fink. 99-113 [doi]
• Dynamic Programming Algorithms as Products of Weighted Logic ProgramsShay B. Cohen, Robert J. Simmons, Noah A. Smith. 114-129 [doi]
• Detecting Inconsistencies in Large Biological Networks with Answer Set ProgrammingMartin Gebser, Torsten Schaub, Sven Thiele, Björn Usadel, Philippe Veber. 130-144 [doi]
• A Logic Programming Approach to Home Monitoring for Risk Prevention in Assisted LivingAlessandra Mileo, Davide Merico, Roberto Bisiani. 145-159 [doi]
• Automatic Composition of Melodic and Harmonic Music by Answer Set ProgrammingGeorg Boenn, Martin Brain, Marina De Vos, John Fitch. 160-174 [doi]
• On the Efficient Execution of ProbLog ProgramsAngelika Kimmig, Vítor Santos Costa, Ricardo Rocha, Bart Demoen, Luc De Raedt. 175-189 [doi]
• Engineering an Incremental ASP SolverMartin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub, Sven Thiele. 190-205 [doi]
• Concurrent and Local Evaluation of Normal ProgramsRui Marques, Terrance Swift. 206-222 [doi]
• On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASPVictor W. Marek, Jeffrey B. Remmel. 223-237 [doi]
• alpha-leanTAP: A Declarative Theorem Prover for First-Order Classical LogicJoseph P. Near, William E. Byrd, Daniel P. Friedman. 238-252 [doi]
• Towards Ludics Programming: Interactive Proof SearchAlexis Saurin. 253-268 [doi]
• Declarative Semantics for Active Integrity ConstraintsLuciano Caroprese, Miroslaw Truszczynski. 269-283 [doi]
• A Folding Algorithm for Eliminating Existential Variables from Constraint Logic ProgramsValerio Senni, Alberto Pettorossi, Maurizio Proietti. 284-300 [doi]
• Negative Ternary Set-SharingEric Trias, Jorge Navas, Elena S. Ackley, Stephanie Forrest, Manuel V. Hermenegildo. 301-316 [doi]
• Termination of Narrowing Using Dependency PairsMaría Alpuente, Santiago Escobar, José Iborra. 317-331 [doi]
• Dynamic Analysis of Bounds Versus Domain PropagationChristian Schulte, Peter J. Stuckey. 332-346 [doi]
• Lparse Programs Revisited: Semantics and Representation of AggregatesGuohua Liu, Jia-Huai You. 347-361 [doi]
• Compiling Fuzzy Answer Set Programs to Fuzzy Propositional TheoriesJeroen Janssen, Stijn Heymans, Dirk Vermeir, Martine De Cock. 362-376 [doi]
• Abstract Answer Set SolversYuliya Lierler. 377-391 [doi]
• Partial Functions and Equality in Answer Set ProgrammingPedro Cabalar. 392-406 [doi]
• Computable Functions in ASP: Theory and ImplementationFrancesco Calimeri, Susanna Cozza, Giovambattista Ianni, Nicola Leone. 407-424 [doi]
• Composing Normal Programs with Function SymbolsSabrina Baselice, Piero A. Bonatti. 425-439 [doi]
• Verification from Declarative Specifications Using Logic ProgrammingMarco Montali, Paolo Torroni, Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello. 440-454 [doi]
• Prolog Based Description Logic ReasoningGergely Lukácsy, Péter Szeredi, Balázs Kádár. 455-469 [doi]
• Resource Management Policy Handling Multiple Use-Cases in MPSoC Platforms Using Constraint ProgrammingLuca Benini, Davide Bertozzi, Michela Milano. 470-484 [doi]
• Optimization of CHR Propagation RulesPeter Van Weert. 485-500 [doi]
• Termination Analysis of CHR RevisitedPaolo Pilozzi, Danny De Schreye. 501-515 [doi]
• Transactions in Constraint Handling RulesTom Schrijvers, Martin Sulzmann. 516-530 [doi]
• Cadmium: An Implementation of ACD Term RewritingGregory J. Duck, Leslie De Koninck, Peter J. Stuckey. 531-545 [doi]
• Quantified Equilibrium Logic and Foundations for Answer Set ProgramsDavid Pearce, Agustín Valverde. 546-560 [doi]
• Elimination of Disjunction and Negation in Answer-Set Programs under HyperequivalenceJörg Pührer, Hans Tompits, Stefan Woltran. 561-575 [doi]
• Relativized Hyperequivalence of Logic Programs for Modular ProgrammingMiroslaw Truszczynski, Stefan Woltran. 576-590 [doi]
• Program Correspondence under the Answer-Set Semantics: The Non-ground CaseJohannes Oetsch, Hans Tompits. 591-605 [doi]
• Efficient Algorithms for Functional ConstraintsYuanlin Zhang, Roland H. C. Yap, Chendong Li, Satyanarayana Marisetti. 606-620 [doi]
• Two WAM Implementations of Action RulesBart Demoen, Phuong-Lan Nguyen. 621-635 [doi]
• Constraint-Level Advice for ShavingRadoslaw Szymanek, Christophe Lecoutre. 636-650 [doi]
• A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-ParallelismAmadeo Casas, Manuel Carro, Manuel V. Hermenegildo. 651-666 [doi]
• Inference with Logic Programs with Annotated Disjunctions under the Well Founded SemanticsFabrizio Riguzzi. 667-671 [doi]
• Safe Formulas in the General Theory of Stable Models (Preliminary Report)Joohyung Lee, Vladimir Lifschitz, Ravi Palla. 672-676 [doi]
• Non-determinism and Probabilities in Timed Concurrent Constraint ProgrammingJorge A. Pérez, Camilo Rueda. 677-681 [doi]
• Stochastic Behavior and Explicit Discrete Time in Concurrent Constraint ProgrammingJesús Aranda, Jorge A. Pérez, Camilo Rueda, Frank D. Valencia. 682-686 [doi]
• TopLog: ILP Using a Logic Program Declarative BiasStephen Muggleton, José Carlos Almeida Santos, Alireza Tamaddoni-Nezhad. 687-692 [doi]
• Towards Typed PrologTom Schrijvers, Vítor Santos Costa, Jan Wielemaker, Bart Demoen. 693-697 [doi]
• Environment Reuse in the WAMBart Demoen, Phuong-Lan Nguyen. 698-702 [doi]
• Logic Engines as InteractorsPaul Tarau. 703-707 [doi]
• Global Storing Mechanisms for Tabled EvaluationJorge Costa, Ricardo Rocha. 708-712 [doi]
• Thread-Based Competitive Or-ParallelismPaulo Moura, Ricardo Rocha, Sara C. Madeira. 713-717 [doi]
• A Logic Language with Stable Model Semantics for Social ReasoningFrancesco Buccafurri, Gianluca Caminiti, Rosario Laurendi. 718-723 [doi]
• ASPVIZ: Declarative Visualisation and Animation Using Answer Set ProgrammingOwen Cliffe, Marina De Vos, Martin Brain, Julian A. Padget. 724-728 [doi]
• Removing Redundancy from Answer Set ProgramsTomi Janhunen. 729-733 [doi]
• ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set ProgrammingUwe Egly, Sarah Alice Gaggl, Stefan Woltran. 734-738 [doi]
• An Implementation of Extended P-Log Using XASPHan The Anh, Carroline D. P. Kencana Ramli, Carlos Viegas Damásio. 739-743 [doi]
• Compiling and Executing Declarative Modeling Languages to GecodeRaffaele Cipriano, Agostino Dovier, Jacopo Mauro. 744-748 [doi]
• Telecommunications Feature Subscription as a Partial Order Constraint ProblemMichael Codish, Vitaly Lagoon, Peter J. Stuckey. 749-753 [doi]
• A Constraint Logic Programming Approach to Automated TestingHakim Belhaouari, Frédéric Peschanski. 754-758 [doi]
• Turing-Complete Subclasses of CHRJon Sneyers. 759-763 [doi]
• A Soft Approach to Multi-objective OptimizationStefano Bistarelli, Fabio Gadducci, Javier Larrosa, Emma Rollon. 764-768 [doi]
• A Multi-theory Logic Language for the World Wide WebGiulio Piancastelli, Andrea Omicini. 769-773 [doi]
• A Case Study in Engineering SQL Constraint Database Systems (Extended Abstract)Sebastien Siva, James J. Lu, Hantao Zhang. 774-778 [doi]
• Policy-Driven Negotiations and Explanations: Exploiting Logic-Programming for Trust Management, Privacy & SecurityPiero A. Bonatti, Juri Luca De Coi, Daniel Olmedilla, Luigi Sauro. 779-784 [doi]
• An Algorithm for Sophisticated Code Matching in Logic ProgramsWim Vanhoof, François Degrave. 785-789 [doi]
• Trace Analysis for Predicting the Effectiveness of Partial EvaluationGermán Vidal. 790-794 [doi]
• A Sketch of a Complete Scheme for Tabled Execution Based on Program TransformationPablo Chico de Guzmán, Manuel Carro, Manuel V. Hermenegildo. 795-800 [doi]
• Probabilistic and Concurrent Models for SecurityRomain Beauxis. 801-802 [doi]
• On the Hybridization of Constraint Programming and Local Search Techniques: Models and Software ToolsRaffaele Cipriano. 803-804 [doi]
• Development of an Automatic Testing Environment for MercuryFrançois Degrave. 805-806 [doi]
• Resolving CSP with Naming GamesGiorgio Gosti. 807-808 [doi]
• Biosequence Analysis in PRISMOle Torp Lassen. 809-810 [doi]
• Bi-dimensional Domains for the Non-overlapping Rectangles ConstraintFabio Parisini. 811-812 [doi]
• Extracting and Reasoning about Web DataGiovanni Pirrotta. 813-814 [doi]
• Managing Quality of Service with Soft ConstraintsFrancesco Santini. 815-817 [doi]
• TopLog: ILP Using a Logic Program Declarative BiasJosé Carlos Almeida Santos. 818-819 [doi]
• Generalising Constraint Solving over Finite DomainsMarkus Triska. 820-821 [doi]
• Detection of Security Vulnerabilities Using Guided Model CheckingAliaksei Tsitovich. 822-823 [doi]