ASP modulo CSP: The clingcon system (Q4911129): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Clingcon / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1210.2287 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lemma Learning in SMT on Linear Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Locating Minimal Infeasible Constraint Sets in Linear Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving SAT and SAT Modulo Theories / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stable models and difference logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integrating answer set programming and constraint logic programming / rank | |||
Normal rank |
Latest revision as of 06:18, 6 July 2024
scientific article; zbMATH DE number 6144683
Language | Label | Description | Also known as |
---|---|---|---|
English | ASP modulo CSP: The clingcon system |
scientific article; zbMATH DE number 6144683 |
Statements
ASP modulo CSP: The clingcon system (English)
0 references
13 March 2013
0 references
non-Boolean constraints
0 references
irreducible inconsistent sets
0 references