Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version

DOI10.1016/j.entcs.2020.10.004OpenAlexW3108137713WikidataQ113317268 ScholiaQ113317268MaRDI QIDQ2133436

Flavio Everardo, Mauricio Osorio

Publication date: 29 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2020.10.004

zbMATH Keywords

combinatorial optimization problemsanswer set programmingparity aggregate operator

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Uses Software

• Gringo
• ASPIDE
• Clingo
• xorro

Cites Work

• Unnamed Item
• Unnamed Item
• Conflict-driven answer set solving: from theory to practice
• Safe beliefs for propositional theories
• Forgetting auxiliary atoms in forks
• Verifying strong equivalence of programs in the input language of \textsc{gringo}
• The return of \textit{xorro}
• Inductive Learning of Answer Set Programs
• Complex optimization in answer set programming
• Minimal Logic Programs
• Short XORs for Model Counting: From Theory to Practice
• Answer Set Programming: A Primer
• Abstract gringo
• Applications of intuitionistic logic in Answer Set Programming
• Strong equivalence made easy: nested expressions and weight constraints
• Propositional theories are strongly equivalent to logic programs
• Logic Programming and Nonmonotonic Reasoning
• Strongly equivalent logic programs

This page was built for publication: Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version