Antonius Weinzierl
Antonius Weinzierl
The following program unexpectedly has Alpha report 2 answer sets while there should be three. ``` :- not 1=#count{ na_1 : a; nb_1 : b; nc_1 : c }. na_1...
Adds weak constraints to Alpha. The parser is able to read them and in their presence the solver switches to a branch-and-bound algorithm. Returned answer sets are adorned with a...
This is a preview PR adding two standard SAT/ASP techniques. Restarts in conjunction with the restricted guessing on applicable rules (in order to compute computation sequences as in other lazy-grounding...
Here we track code quality issues that became visible due to the modularization. The goal is to fix those issues after the basic modularization has been merged into master, as...
Alpha uses a CDNL-based solving component which learns new nogoods after running into conflicts. Over time, the number of nogoods becomes very large and many of the learned ones are...
The `NaiveGrounder` is now quite far away from implementing just a naive grounding procedure and it is used by default (with no real alternative at the moment). Therefore it is...
The following program tries to evaluate `f(1+b)`, which contains an undefined arithmetic. An exception is thrown although the ground instance should be simply ignore. ``` q(1). q(b). r(H) :- H...
There currently is no correct and reliable safety check in place. Safety of rules is established only after normalization when the `RuleGroundingOrder` is running. There currently may be non-safe programs...
Add additional completion nogoods.
In order to realize arithmetics as per the standard, the following is required: - [ ] The parser needs to take operator precedence into account (`*` and `/` before `+`...