Rewriting optimization statements in answer-set programs

DOI10.4230/OASIcs.ICLP.2016.5zbMath1428.68281OpenAlexW2594402149MaRDI QIDQ5240209

Martin Gebser, Tomi Janhunen, Jori Bomanson

Publication date: 24 October 2019

Full work available at URL: http://dx.doi.org/10.4230/OASIcs.ICLP.2016.5

zbMATH Keywords

answer-set programmingpseudo-Boolean optimizationtranslation methods

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (2)

The Seventh Answer Set Programming Competition: Design and Results ⋮ Boosting Answer Set Optimization with Weighted Comparator Networks

Uses Software

• MiniSat
• WASP

Cites Work

• Unnamed Item
• Unnamed Item
• Logic programming and nonmonotonic reasoning. 13th international conference, LPNMR 2015, Lexington, KY, USA, September 27--30, 2015. Proceedings
• Learning discrete decomposable graphical models via constraint optimization
• Cardinality networks: a theoretical and empirical study
• Design and results of the Fifth Answer Set Programming Competition
• Extending and implementing the stable model semantics
• Conflict-driven answer set solving: from theory to practice
• Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
• Perfect Hashing and CNF Encodings of Cardinality Constraints
• Normalizing Cardinality Rules Using Merging and Sorting Constructions
• Applying Visible Strong Equivalence in Answer-Set Program Transformations
• Improving the Normalization of Weight Rules in Answer Set Programs
• Optimal Base Encodings for Pseudo-Boolean Constraints
• Advances in WASP
• The Design of the Sixth Answer Set Programming Competition
• New Encodings of Pseudo-Boolean Constraints into CNF
• ASP-Core-2 Input Language Format
• The DLV system for knowledge representation and reasoning
• Answer set programming as a modeling language for course timetabling
• A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints

This page was built for publication: Rewriting optimization statements in answer-set programs