Cmodels
| swMATH ID: | 4435 |
| Software Authors: | Lierler, Yulia |
| Description: | Cmodels is a system that computes answer sets for either disjunctive logic programs or logic programs containing choice rules. Answer set solver Cmodels uses SAT solvers as a search engine for enumerating models of the logic program – possible solutions, in case of disjunctive programs SAT solver zChaff is also used for verifying the minimality of found models. The system Cmodels is based on the relation between two semantics: the answer set and the completion semantics for logic programs. For big class of programs called tight, the answer set semantics is equivalent to the completion semantics, so that the answer sets for such a program can be enumerated by a SAT solver. On the other hand for nontight programs [6], and [7] introduced the concept of the loop formulas, and showed that models of completion extended by all the loop formulas of the program are equivalent to the answer sets of th! e program. Unfortunetly number of loop formulas might be large, therefore computing all of them may become computationally expensive. This led to the adoption of the algorithm that computes loop formulas ”as needed” for finding answer sets of a program. |
| Homepage: | http://www.cs.utexas.edu/users/tag/cmodels.html |
| Programming Languages: | C++ |
| Operating Systems: | Sun/Linux/Windows |
| Related Software: | ASSAT; Smodels; Gringo; clasp; Chaff; WASP; Lparse; MiniSat; NoMoRe; DLV; Clingo; Datalog; GNT; Potassco; nomore++; DLV2; IDP3; GASP; maxino; BerkMin |
| Cited in: | 68 Documents |
all
top 5
Cited by 105 Authors
all
top 5
