Rewriting optimization statements in answer-set programs

DOI10.4230/OASICS.ICLP.2016.5MaRDI QIDQ5240209zbMATH OpenOpenAlexFDO

Authors Jori Bomanson, Martin Gebser, Tomi Janhunen

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)

Recommendations

• Boosting Answer Set Optimization with Weighted Comparator Networks
• Max-ASP: Maximum Satisfiability of Answer Set Programs
• Item:QQ2409731
• Item:QQ2409731
• Improving the normalization of weight rules in answer set programs

Cites work

• scientific article; zbMATH DE number 5139161 (Why is no real title available?)
• scientific article; zbMATH DE number 5139165 (Why is no real title available?)
• A parametric approach for smaller and better encodings of cardinality constraints
• ASP-Core-2 input language format
• Advances in WASP
• Answer set programming as a modeling language for course timetabling
• Applying visible strong equivalence in answer-set program transformations
• Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
• Cardinality networks: a theoretical and empirical study
• Conflict-driven answer set solving: from theory to practice
• Design and results of the Fifth Answer Set Programming Competition
• Extending and implementing the stable model semantics
• Improving the normalization of weight rules in answer set programs
• Learning discrete decomposable graphical models via constraint optimization
• Logic programming and nonmonotonic reasoning. 13th international conference, LPNMR 2015, Lexington, KY, USA, September 27--30, 2015. Proceedings
• New Encodings of Pseudo-Boolean Constraints into CNF
• Normalizing cardinality rules using merging and sorting constructions
• Optimal base encodings for pseudo-Boolean constraints
• Perfect hashing and CNF encodings of cardinality constraints
• The DLV system for knowledge representation and reasoning
• The Design of the Sixth Answer Set Programming Competition

Cited in

(6)

• Boosting Answer Set Optimization with Weighted Comparator Networks
• IASCAR: incremental answer set counting by anytime refinement
• Improving the normalization of weight rules in answer set programs
• The Seventh Answer Set Programming Competition: Design and Results
• How to build your own ASP-based system?!
• On the Expressivity of Optimality Theory versus Ordered Rewrite Rules

Describes a project that uses

Uses Software

• WASP
• MiniSat

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

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