| 1. |
-
Applications of declarative programming and knowledge management : 19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers
- 2013
-
Proceedings (redaktörskap) (refereegranskat)abstract
- This book constitutes revised selected papers of the 19th International Conference on Applications of Declarative Programming and Knowledge Management, INAP 2011, and the 25th Workshop on Logic Programming, WLP 2011, held in Vienna, Austria, in September 2011. The 19 papers presented in this volume were carefully reviewed and selected from 27 papers presented at the conference and initially a total of 35 submissions. The book also contains the papers of two invited talks. The papers are organized in topical sections on languages; answer-set programming and abductive reasoning; constraints and logic programming; answer-set programming and model expansion; application papers; and system descriptions.
|
|
| 2. |
- Brain, Martin, et al.
(författare)
-
Event-sequence testing using answer-set programming
- 2012
-
Ingår i: International Journal on Advances in Software. - 1942-2628. ; 5:3 & 4, s. 237-251
-
Tidskriftsartikel (refereegranskat)abstract
- In many applications, faults are triggered by events that occur in a particular order. In fact, many bugs are caused by the interaction of only a low number of such events. Based on this assumption, sequence covering arrays (SCAs) have recently been proposed as suitable designs for event sequence testing. In practice, directly applying SCAs for testing is often impaired by additional constraints, and SCAs have to be adapted to fit application-specific needs. Modifying precomputed SCAs to account for problem variations can be problematic, if not impossible, and developing dedicated algorithms is costly. In this article, we propose answer-set programming (ASP), a well-known knowledge-representation formalism from the area of artificial intelligence based on logic programming, as a declarative paradigm for computing SCAs. Our approach allows to concisely state complex coverage criteria in an elaboration tolerant way, i.e., small variations of a problem specification require only small modifications of the ASP representation. Employing ASP for computing SCAs is further justified by new complexity results related to event-sequence testing that are established in this work.
|
|
| 3. |
- Busoniu, Paula-Andra, et al.
(författare)
-
SeaLion : An eclipse-based IDE for answer-set programming with advanced debugging support
- 2013
-
Ingår i: Theory and Practice of Logic Programming. - : Cambridge University Press. - 1471-0684 .- 1475-3081. ; 13:4-5, s. 657-673
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, we present SeaLion, an integrated development environment (IDE) for answer-set programming (ASP). SeaLion provides source-code editors for the languages of Gringo and DLV and offers popular amenities like syntax highlighting, syntax checking, code completion, visual program outline, and refactoring functionality. The tool has been realised in the context of a research project whose goal is the development of techniques to support the practical coding process of answer-set programs. In this respect, SeaLion is the first IDE for ASP that provides debugging features that work for real-world answer-set programs and supports the rich languages of modern answer-set solvers. Indeed, SeaLion implements a stepping-based debugging approach that allows the developer to quickly track down programming errors by simply following his or her intuitions on the intended semantics. Besides that, SeaLion supports ASP development using model-driven engineering techniques including domain modelling with extended UML class diagrams and visualisation of answer sets in corresponding instance diagrams. Moreover, customised visualisation as well as visual editing of answer sets is realised by the Kara plugin of SeaLion. Further implemented features are a documentation generator based on the Lana annotation language, support for external solvers, and interoperability with external tools. SeaLion comes as a plugin of the popular Eclipse platform and provides interfaces for future extensions of the IDE.
|
|
| 4. |
- De Vos, Marina, et al.
(författare)
-
Annotating answer-set programs in Lana
- 2012
-
Ingår i: Theory and Practice of Logic Programming. - : Cambridge University Press. - 1471-0684 .- 1475-3081. ; 12:4-5, s. 619-637
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 5. |
- De Vos, Marina, et al.
(författare)
-
LANA: A Language for Annotating Answer-Set Programs
- 2012
-
Konferensbidrag (refereegranskat)abstract
- 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 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 to group 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 bytools for documentation, testing, and verification purposes, and can help to eliminate sources of common programming errors by realising syntax checking or code completion features. 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.
|
|
| 6. |
- Erdem, Esra, et al.
(författare)
-
Answer-set programming as a new approach to event-sequence testing
- 2011
-
Ingår i: VALID 2011 - 3rd International Conference on Advances in System Testing and Validation Lifecycle. - 9781612081687 ; , s. 25-34
-
Konferensbidrag (refereegranskat)abstract
- In many applications, faults are triggered by events that occur in a particular order. Based on the assumption that most bugs are caused by the interaction of a low number of events, Kuhn et al. recently introduced sequence covering arrays (SCAs) as suitable designs for event sequence testing. In practice, directly applying SCAs for testing is often impaired by additional constraints, and SCAs have to be adapted to fit application-specific needs. Modifying precomputed SCAs to account for problem variations can be problematic, if not impossible, and developing dedicated algorithms is costly. In this paper, we propose answer-set programming (ASP), a well-known knowledge-representation formalism from the area of artificial intelligence based on logic programming, as a declarative paradigm for computing SCAs. Our approach allows to concisely state complex coverage criteria in an elaboration tolerant way, i.e., small variations of a problem specification require only small modifications of the ASP representation.
|
|
| 7. |
- Greßler, Alexander, et al.
(författare)
-
Harvey : A system for random testing in ASP
- 2017
-
Ingår i: Logic Programming and Nonmonotonic Reasoning. - Cham : Springer. - 9783319616599 ; , s. 229-235
-
Konferensbidrag (refereegranskat)abstract
- We present Harvey, a tool for random testing in answer-set programming (ASP) that allows to incorporate constraints to guide the generation of test inputs. Due to the declarative nature of ASP, it can be argued that there is less need for testing than in conventional software development. However, it is shown in practice that testing is still needed when more sophisticated methods are not viable. Random testing is recognised as a simple yet effective method in this regard. The approach described in this paper allows for random testing of answerset programs in which both test-input generation and determining test verdicts is facilitated using ASP itself: The test-input space is defined using ASP rules and uniformity of test-input selection is achieved by using XOR sampling. This allows to go beyond simple random testing by adding further ASP constraints in the process.
|
|
| 8. |
- Janhunen, Tomi, et al.
(författare)
-
On testing answer-set programs
- 2010
-
Ingår i: Frontiers in Artificial Intelligence and Applications. - : IOS Press. - 9781607506058 ; , s. 951-956
-
Konferensbidrag (refereegranskat)abstract
- Answer-set programming (ASP) is a well-acknowledged paradigm for declarative problem solving, yet comparably little effort has been spent on the investigation of methods to support the development of answer-set programs. In particular, systematic testing of programs, constituting an integral part of conventional software development, has not been discussed for ASP thus far. In this paper, we fill this gap and develop notions enabling the structural testing of answer-set programs, i.e., we address testing based on test cases that are chosen with respect to the internal structure of a given answer-set program. More specifically, we introduce different notions of coverage that measure to what extent a collection of test inputs covers certain important structural components of the program. In particular, we introduce metrics corresponding to path and branch coverage from conventional testing. We also discuss complexity aspects of the considered notions and give strategies how test inputs that yield increasing (up to total) coverage can be automatically generated.
|
|
| 9. |
- Janhunen, Tomi, et al.
(författare)
-
Random vs. structure-based testing of answer-set programs : An experimental comparison
- 2011
-
Ingår i: Logic Programming and Nonmonotonic Reasoning. - Berlin, Heidelberg : Springer. - 9783642208942 ; , s. 242-247
-
Konferensbidrag (refereegranskat)abstract
- Answer-set programming (ASP) is an established paradigm for declarative problem solving, yet comparably little work on testing of answer-set programs has been done so far. In a recent paper, foundations for structure-based testing of answer-set programs building on a number of coverage notions have been proposed. In this paper, we develop a framework for testing answer-set programs based on this work and study how good the structure-based approach to test input generation is compared to random test input generation. The results indicate that random testing is quite ineffective for some benchmarks, while structure-based techniques catch faults with a high rate more consistently also in these cases.
|
|
| 10. |
- Kloimüllner, Christian, et al.
(författare)
-
Kara : A system for visualising and visual editing of interpretations for answer-set programs
- 2013
-
Ingår i: Applications of Declarative Programming and Knowledge Management. - Berlin, Heidelberg : Springer. - 9783642415234 ; , s. 325-344
-
Konferensbidrag (refereegranskat)abstract
- In answer-set programming (ASP), the solutions of a problem are encoded in dedicated models, called answer sets, of a logical theory. These answer sets are computed from the program that represents the theory by means of an ASP solver and returned to the user as sets of ground first-order literals. As this type of representation is often cumbersome for the user to interpret, tools like ASPVIZ and IDPDraw were developed that allow for visualising answer sets. The tool Kara, introduced in this paper, follows these approaches, using ASP itself as a language for defining visualisations of interpretations. Unlike existing tools that position graphic primitives according to static coordinates only, Kara allows for more high-level specifications, supporting graph structures, grids, and relative positioning of graphical elements. Moreover, generalising the functionality of previous tools, Kara provides modifiable visualisations such that interpretations can be manipulated by graphically editing their visualisations. This is realised by resorting to abductive reasoning techniques using ASP itself. Kara is part of SeaLion, an integrated development environment (IDE) for ASP.
|
|
