Model enumeration via assumption literals

DOI10.3233/FI-2019-1809MaRDI QIDQ5223207zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

answer set programmingassumption literalsenumeration

Mathematics Subject Classification ID

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

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

Cited in

(8)

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

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)