Boosting Answer Set Optimization with Weighted Comparator Networks

DOI10.1017/S147106842000006XzbMath1472.68023arXiv2003.03332OpenAlexW3098615674MaRDI QIDQ4957202

Tomi Janhunen, Jori Bomanson

Publication date: 3 September 2021

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.03332

zbMATH Keywords

normalizationtranslationanswer set programmingcomparator networkoptimization rewriting

Mathematics Subject Classification ID

Knowledge representation (68T30) Grammars and rewriting systems (68Q42) Logic programming (68N17)

Uses Software

• clasp
• WASP
• Clingo
• MaxHS
• Picat-SAT
• lp2normal

Cites Work

• Unnamed Item
• MaxHS
• On abstract modular inference systems and solvers
• 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
• Conflict-driven answer set solving: from theory to practice
• Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
• Logic programming and nonmonotonic reasoning. 14th international conference, LPNMR 2017, Espoo, Finland, July 3--6, 2017. Proceedings
• The design of the Seventh Answer Set Programming Competition
• \textsc{lp2normal} -- a normalization tool for extended logic programs
• Normalizing Cardinality Rules Using Merging and Sorting Constructions
• Improving the Normalization of Weight Rules in Answer Set Programs
• Tableau Calculi for Logic Programs under Answer Set Semantics
• Abstract answer set solvers with backjumping and learning
• A New Look at BDDs for Pseudo-Boolean Constraints
• Optimum stable model search: algorithms and implementation
• Advances in WASP
• Progress in clasp Series 3
• Multi-level Algorithm Selection for ASP
• The Design of the Sixth Answer Set Programming Competition
• Solving SAT and SAT Modulo Theories
• Extended ASP Tableaux and rule redundancy in normal logic programs
• Rewriting optimization statements in answer-set programs
• Why are there so many loop formulas?
• The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment
• Answer Set Solving with Lazy Nogood Generation
• Unsatisfiability-based optimization in clasp
• Answer set programming as a modeling language for course timetabling
• A Permutation Network

This page was built for publication: Boosting Answer Set Optimization with Weighted Comparator Networks