default search action
21st PADL 2019: Lisbon, Portugal
- José Júlio Alferes, Moa Johansson:
Practical Aspects of Declarative Languages - 21th International Symposium, PADL 2019, Lisbon, Portugal, January 14-15, 2019, Proceedings. Lecture Notes in Computer Science 11372, Springer 2019, ISBN 978-3-030-05997-2 - Yuliya Lierler:
Strong Equivalence and Program's Structure in Arguing Essential Equivalence Between First-Order Logic Programs. 1-18 - Nicholas Hippen, Yuliya Lierler:
Automatic Program Rewriting in Non-Ground Answer Set Programs. 19-36 - Muhammed Kerem Kahraman, Esra Erdem:
Personalized Course Schedule Planning Using Answer Set Programming. 37-45 - Dhruva Pendharkar, Gopal Gupta:
An ASP Based Approach to Answering Questions for Natural Language Text. 46-63 - Van Nguyen, Tran Cao Son, Enrico Pontelli:
Natural Language Generation from Ontologies. 64-81 - Michael Hanus:
Improving Residuation in Declarative Programs. 82-97 - Joaquín Arias, Manuel Carro:
Incremental Evaluation of Lattice-Based Aggregates in Logic Programming Using Modular TCLP. 98-114 - Paul Tarau:
A Combinatorial Testing Framework for Intuitionistic Propositional Theorem Provers. 115-132 - Ruben P. Pieters, Tom Schrijvers:
Faster Coroutine Pipelines: A Reconstruction. 133-149 - Alejandro Serrano, Victor Cacciari Miraldo:
Classes of Arbitrary Kind. 150-168 - Kristoffer Just Arndal Andersen, Ilya Sergey:
Distributed Protocol Combinators. 169-186 - Viktor Palmkvist, David Broman:
Creating Domain-Specific Languages by Composing Syntactical Constructs. 187-203 - Christopher Schwaab, Ekaterina Komendantskaya, Alasdair Hill, Frantisek Farka, Ronald P. A. Petrick, Joe B. Wells, Kevin Hammond:
Proof-Carrying Plans. 204-220 - Alexander Asp Bock:
Static Partitioning of Spreadsheets for Parallel Execution. 221-237
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.