Abstract is missing.
- Strong Equivalence and Program's Structure in Arguing Essential Equivalence Between First-Order Logic ProgramsYuliya Lierler. 1-18 [doi]
- Automatic Program Rewriting in Non-Ground Answer Set ProgramsNicholas Hippen, Yuliya Lierler. 19-36 [doi]
- Personalized Course Schedule Planning Using Answer Set ProgrammingMuhammed Kerem Kahraman, Esra Erdem 0001. 37-45 [doi]
- An ASP Based Approach to Answering Questions for Natural Language TextDhruva Pendharkar, Gopal Gupta. 46-63 [doi]
- Natural Language Generation from OntologiesVan Nguyen, Tran Cao Son, Enrico Pontelli. 64-81 [doi]
- Improving Residuation in Declarative ProgramsMichael Hanus. 82-97 [doi]
- Incremental Evaluation of Lattice-Based Aggregates in Logic Programming Using Modular TCLPJoaquín Arias, Manuel Carro. 98-114 [doi]
- A Combinatorial Testing Framework for Intuitionistic Propositional Theorem ProversPaul Tarau. 115-132 [doi]
- Faster Coroutine Pipelines: A ReconstructionRuben P. Pieters, Tom Schrijvers. 133-149 [doi]
- Classes of Arbitrary KindAlejandro Serrano, Victor Cacciari Miraldo. 150-168 [doi]
- Distributed Protocol CombinatorsKristoffer Just Arndal Andersen, Ilya Sergey. 169-186 [doi]
- Creating Domain-Specific Languages by Composing Syntactical ConstructsViktor Palmkvist, David Broman. 187-203 [doi]
- Proof-Carrying PlansChristopher Schwaab, Ekaterina Komendantskaya, Alasdair Hill, Frantisek Farka, Ronald P. A. Petrick, Joe B. Wells, Kevin Hammond. 204-220 [doi]
- Static Partitioning of Spreadsheets for Parallel ExecutionAlexander Asp Bock. 221-237 [doi]