Model enumeration via assumption literals

DOI10.3233/FI-2019-1809zbMATH Open1415.68222OpenAlexW2949030274WikidataQ114584471 ScholiaQ114584471MaRDI QIDQ5223207FDOQ5223207

Authors: M. Alviano, Carmine Dodaro 

Publication date: 17 July 2019

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2019-1809

Recommendations

• Answer set enumeration via assumption literals
• Conflict-Driven Answer Set Enumeration
• Logic Programming
• Abstract Answer Set Solvers
• ASSAT: computing answer sets of a logic program by SAT solvers

zbMATH Keywords

enumerationanswer set programmingassumption literals

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cited In (8)

• An isomorph-free SEM-like enumeration of models
• ASP and subset minimality: enumeration, cautious reasoning and MUSes
• Solution Enumeration by Optimality in Answer Set Programming
• Answer set enumeration via assumption literals
• On enumerating short projected models
• Conflict-Driven Answer Set Enumeration
• Solution Enumeration for Projected Boolean Search Problems
• Enumeration of minimal models and MUSes in WASP

This page was built for publication: Model enumeration via assumption literals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223207)