| Class Tree | |
|---|---|
| Description |
RLP (Randomly generated Logic Programs) can be used as benchmark problems for ASP (Answer Set Programming) systems. For more details of the research of RLP under answer set semantics please refer to this paper. It is observed that there is an "easy-hard-easy" pattern in k-LP(N). For 3-LP(N), the hard-job region is around L/N= 5, where L is the number of rules and N the number of atoms. Source: http://assat.cs.ust.hk/benchmark.rlp |
| Submitter | Martin Gebser |
| Compatible Encodings |
|
| Output Predicates |
|
| Instances 1 - 20 of 282 |
|
Expand All
Collapse All
