Abstract is missing.
- Datalog for Enterprise Software: from Industrial Applications to Research (Invited Talk)Molham Aref. 1 [doi]
- A Logical Paradigm for Systems Biology (Invited Talk)François Fages. 2-3 [doi]
- Runtime Addition of Integrity Constraints in an Abductive Proof ProcedureMarco Alberti, Marco Gavanelli, Evelina Lamma. 4-13 [doi]
- Learning Domain-Specific Heuristics for Answer Set SolversMarcello Balduccini. 14-23 [doi]
- HEX Programs with Action AtomsSelen Basol, Ozan Erdem, Michael Fink, Giovambattista Ianni. 24-33 [doi]
- Communicating Answer Set ProgramsKim Bauters, Jeroen Janssen, Steven Schockaert, Dirk Vermeir, Martine De Cock. 34-43 [doi]
- Implementation Alternatives for Bottom-Up EvaluationStefan Brass. 44-53 [doi]
- Inductive Logic Programming as Abductive SearchDomenico Corapi, Alessandra Russo, Emil Lupu. 54-63 [doi]
- Efficient Solving of Time-dependent Answer Set ProgramsTimur Fayruzov, Jeroen Janssen, Dirk Vermeir, Chris Cornelis, Martine De Cock. 64-73 [doi]
- Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program SpecializationDaan Fierens. 74-83 [doi]
- Focused Proof Search for Linear Logic in the Calculus of StructuresNicolas Guenot. 84-93 [doi]
- Sampler Programs: The Stable Model Semantics of Abstract Constraint Programs RevisitedTomi Janhunen. 94-103 [doi]
- A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage VerificationPedro López-García, Luthfi Darmawan, Francisco Bueno. 104-113 [doi]
- Contractibility and Contractible Approximations of Soft Global ConstraintsMichael J. Maher. 114-123 [doi]
- Dedicated Tabling for a Probabilistic SettingTheofrastos Mantadelis, Gerda Janssens. 124-133 [doi]
- Tight Semantics for Logic ProgramsLuís Moniz Pereira, Alexandre Miguel Pinto. 134-143 [doi]
- From Relational Specifications to Logic ProgramsJoseph P. Near. 144-153 [doi]
- Methods and Methodologies for Developing Answer-Set Programs - Project DescriptionJohannes Oetsch, Jörg Pührer, Hans Tompits. 154-161 [doi]
- Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated DisjunctionsFabrizio Riguzzi, Terrance Swift. 162-171 [doi]
- Subsumer: A Prolog theta-subsumption engineJose Santos, Stephen Muggleton. 172-181 [doi]
- Using Generalized Annotated Programs to Solve Social Network Optimization ProblemsPaulo Shakarian, V. S. Subrahmanian, Maria Luisa Sapino. 182-191 [doi]
- Abductive Inference in Probabilistic Logic ProgramsGerardo I. Simari, V. S. Subrahmanian. 192-201 [doi]
- Circumscription and Projection as Primitives of Logic ProgrammingChristoph Wernhard. 202-211 [doi]
- Timed Definite Clause Omega-GrammarsNeda Saeedloei, Gopal Gupta. 212-221 [doi]
- Towards a Parallel Virtual Machine for Functional Logic ProgrammingAbdulla Alqaddoumi. 222-225 [doi]
- Dynamic Magic Sets for Disjunctive Datalog ProgramsMario Alviano. 226-235 [doi]
- Bisimilarity in Concurrent Constraint ProgrammingAndrés A. Aristizábal P.. 236-240 [doi]
- Program analysis for code duplication in logic programsCeline Dandois. 241-247 [doi]
- Program Analysis to Support Concurrent Programming in Declarative LanguagesRomain Demeyer. 248-254 [doi]
- Constraint Answer Set Programming SystemsChristian Drescher. 255-264 [doi]
- Towards a General Argumentation System based on Answer-Set ProgrammingSarah Alice Gaggl. 265-269 [doi]
- Models for Trustworthy Service and Process Oriented SystemsHugo A. López. 270-276 [doi]
- Design and Implementation of a Concurrent Logic Programming Language with Linear Logic ConstraintsThierry Martinez. 277-280 [doi]
- Higher-order Logic Learning and lambda-ProgolNiels Pahlavi. 281-285 [doi]
- Local Branching in a Constraint Programming FrameworkFabio Parisini. 286-288 [doi]
- Logic Programming Foundations of Cyber-Physical SystemsNeda Saeedloei. 289-293 [doi]
- Realizing the Dependently Typed Lambda CalculusZachary Snow. 294-299 [doi]
- Structured Interactive Musical ScoresMauricio Toro-Bermúdez. 300-302 [doi]
- Cutting-Edge Timing Analysis TechniquesJakob Zwirchmayr. 303-305 [doi]