aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming

DOI10.1007/978-3-319-23264-5_10zbMath1467.68160arXiv1312.6113OpenAlexW1927521586MaRDI QIDQ3449196

Max Ostrowski, Katsumi Inoue, Martin Gebser, Torsten Schaub, Matthias Weise, Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, Andrea Peano

Publication date: 4 November 2015

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (3)

aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming ⋮ Clingo goes linear constraints over reals and integers ⋮ Clingcon: The next generation

Uses Software

• Clingcon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Promoting robust black-box solvers through competitions
• Compiling finite linear CSP into SAT
• Propagation via lazy clause generation
• Another look at graph coloring via propositional satisfiability
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
• A translational approach to constraint answer set solving
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Constraint Answer Set Solving
• Compiling finite domain constraints to SAT withBEE
• ASP modulo CSP: The clingcon system
• Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
• Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers

This page was built for publication: aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming