On testing answer-set programs
DOI10.3233/978-1-60750-606-5-951zbMATH Open1211.68383OpenAlexW1487621638MaRDI QIDQ2999229FDOQ2999229
Authors: Tomi Janhunen, Johannes Oetsch, Jörg Pührer, Hans Tompits, Ilkka Niemelä
Publication date: 11 May 2011
Full work available at URL: https://doi.org/10.3233/978-1-60750-606-5-951
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30) Logic in artificial intelligence (68T27)
Cited In (12)
- Methods and methodologies for developing answer-set programs -- project description
- Catnap: generating test suites of constrained combinatorial testing with answer set programming
- Generating event-sequence test cases by answer set programming with the incidence matrix
- Using Answer Set Programming for the Automatic Compilation of Assessment Tests
- On structural analysis of non-ground answer-set programs
- A Tarskian informal semantics for answer set programming
- Two-dimensional approximation coverage
- Testing in ASP: revisited language and programming environment
- \(\mathsf {Harvey}\): a system for random testing in ASP
- Property testers for dense constraint satisfaction programs on finite domains
- Testing and debugging techniques for answer set solver development
- Annotating answer-set programs in LANA
Uses Software
This page was built for publication: On testing answer-set programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999229)