Answer set programming and plan generation
Artificial Intelligence
Test Driven Development: By Example
Test Driven Development: By Example
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Building a knowledge base: an example
Annals of Mathematics and Artificial Intelligence
Developing a Declarative Rule Language for Applications in Product Configuration
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
The DLVK Planning System: Progress Report
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Modular Logic Programming and Generalized Quantifiers
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Stable Model Semantics of Weight Constraint Rules
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Annotations for Prolog - A Concept and Runtime Handling
LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
ASPVIZ: Declarative Visualisation and Animation Using Answer Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
SAT-based answer set programming
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Modularity aspects of disjunctive stable models
Journal of Artificial Intelligence Research
On Testing Answer-Set Programs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Automatic music composition using answer set programming
Theory and Practice of Logic Programming
Random vs. structure-based testing of answer-set programs: an experimental comparison
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
ASPIDE: integrated development environment for answer set programming
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
| Hi-index | 0.00 |
While past research in answer-set programming (ASP) mainly focused on theory, ASP solver technology, and applications, the present work situates itself in the context of a quite recent research trend: development support for ASP. In particular, we propose to augment answer-set programs with additional meta-information formulated in a dedicated annotation language, called Lana. This language allows the grouping of rules into coherent blocks and to specify language signatures, types, pre-and postconditions, as well as unit tests for such blocks. While these annotations are invisible to an ASP solver, as they take the form of program comments, they can be interpreted by tools for documentation, testing, and verification purposes, as well as to eliminate sources of common programming errors by realising syntax checking or code completion features. To demonstrate its versatility, we introduce two such tools, viz. (i) ASPDoc, for generating an HTML documentation for a program based on the annotated information, and (ii) ASPUnit, for running and monitoring unit tests on program blocks. Lana is also exploited in the SeaLion system, an integrated development environment for ASP based on Eclipse.