Fadi A. Aloul
Karim A. Sakallah
Igor L. Markov
2006
Efficient symmetry breaking for Boolean satisfiability
IEEE Transactions on Computers
55
5
549–558
10.1109/TC.2006.75
Mario Alviano
Giovanni Amendola
Carmine Dodaro
Nicola Leone
Marco Maratea
Francesco Ricca
2019
Evaluation of Disjunctive Programs in WASP
Proceedings of LPNMR
LNCS
11481
241–255
10.1007/978-3-030-20528-7_18
Mario Alviano
Carmine Dodaro
Wolfgang Faber
Nicola Leone
Francesco Ricca
2013
WASP: A Native ASP Solver Based on Constraint Learning
Proceedings of LPNMR
54–66
10.1007/978-3-642-40564-8_6
Mario Alviano
Wolfgang Faber
2018
Aggregates in Answer Set Programming
KI
32
2-3
119–124
10.1007/s13218-018-0545-9
Benjamin Andres
David Rajaratnam
Orkunt Sabuncu
Torsten Schaub
2015
Integrating ASP into ROS for Reasoning in Robots
Proceedings of LPNMR
69–82
10.1007/978-3-319-23264-5_7
Mutsunori Banbara
Benjamin Kaufmann
Max Ostrowski
Torsten Schaub
2017
Clingcon: The next generation
TPLP
17
4
408–461
10.1017/S1471068417000138
Clark W. Barrett
Roberto Sebastiani
Sanjit A. Seshia
Cesare Tinelli
2009
Satisfiability Modulo Theories
Handbook of Satisfiability
825–885
10.3233/978-1-58603-929-5-825
Rachel Ben-Eliyahu
Rina Dechter
1994
Propositional Semantics for Disjunctive Logic Programs
Ann. Math. Artif. Intell.
12
1-2
53–87
10.1007/BF01530761
Daniel Le Berre
Anne Parrain
2010
The Sat4j library, release 2.2
JSAT
7
2-3
59–6
Jori Bomanson
2017
lp2normal - A Normalization Tool for Extended Logic Programs
Proceedings of LPNMR
222–228
10.1007/978-3-319-61660-5_20
Daniel R. Brooks
Esra Erdem
Selim T. Erdogan
James W. Minett
Donald Ringe
2007
Inferring Phylogenetic Trees Using Answer Set Programming
J. Autom. Reasoning
39
4
471–511
10.1007/s10817-007-9082-1
Maurice Bruynooghe
Hendrik Blockeel
Bart Bogaerts
Broes De Cat
Stef De Pooter
Joachim Jansen
Anthony Labarre
Jan Ramon
Marc Denecker
Sicco Verwer
2015
Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
TPLP
15
6
783–817
10.1017/S147106841400009X
Francesco Calimeri
Wolfgang Faber
Martin Gebser
Giovambattista Ianni
Roland Kaminski
Thomas Krennwallner
Nicola Leone
Marco Maratea
Francesco Ricca
Torsten Schaub
2020
ASP-Core-2 Input Language Format
TPLP
20
2
294–309
10.1017/S1471068419000450
Donald Chai
Andreas Kuehlmann
2005
A fast pseudo-Boolean constraint solver
IEEE Trans. on CAD of Integrated Circuits and Systems
24
3
305–317
10.1109/TCAD.2004.842808
William J. Cook
Collette R. Coullard
György Turán
1987
On the complexity of cutting-plane proofs
Discrete Applied Mathematics
18
1
25–38
10.1016/0166-218X(87)90039-4
Broes De Cat
Bart Bogaerts
Jo Devriendt
Marc Denecker
2013
Model Expansion in the Presence of Function Symbols Using Constraint Programming
Proceedings of ICTAI
1068–1075
10.1109/ICTAI.2013.159
Jo Devriendt
Bart Bogaerts
2016
BreakID: Static Symmetry Breaking for ASP (System Description)
Bart Bogaerts
Amelia Harrison
Proceedings of ASPOCP
25–39
Jo Devriendt
Bart Bogaerts
Maurice Bruynooghe
2017
Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT
Proceedings of SAT
83–100
10.1007/978-3-319-66263-3_6
Jo Devriendt
Bart Bogaerts
Maurice Bruynooghe
Marc Denecker
2016
Improved Static Symmetry Breaking for SAT
Proceedings of SAT
104–122
10.1007/978-3-319-40970-2_8
Heidi E. Dixon
Matthew L. Ginsberg
2002
Inference Methods for a Pseudo-Boolean Satisfiability Solver
Proceedings of AAAI
635–640
C. Drescher
O. Tifrea
T. Walsh
2011
Symmetry-breaking Answer Set Solving
AI Communications
24
2
177–194
10.3233/AIC-2011-0495
Christian Drescher
Toby Walsh
2011
Conflict-Driven Constraint Answer Set Solving with Lazy Nogood Generation
AAAI
1772–1773
Jan Elffers
Jesús Giráldez-Cru
Jakob Nordström
Marc Vinyals
2018
Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers
Proceedings of SAT
75–93
10.1007/978-3-319-94144-8_5
Jan Elffers
Jakob Nordström
2018
Divide and Conquer: Towards Faster Pseudo-Boolean Solving
Proceedings of IJCAI
1291–1299
10.24963/ijcai.2018/180
Wolfgang Faber
Gerald Pfeifer
Nicola Leone
2011
Semantics and complexity of recursive aggregates in answer set programming
AIJ
175
1
278–298
10.1016/j.artint.2010.04.002
Paolo Ferraris
2005
Answer Sets for Propositional Theories
Proceedings of LPNMR
119–131
10.1007/11546207_10
Martin Gebser
Tomi Janhunen
Jussi Rintanen
2014
Answer Set Programming as SAT modulo Acyclicity
Proceedings of ECAI
351–356
10.3233/978-1-61499-419-0-351
Martin Gebser
Benjamin Kaufmann
Torsten Schaub
2012
Conflict-driven answer set solving: From theory to practice
AIJ
187
52–89
10.1016/j.artint.2012.04.001
Martin Gebser
Joohyung Lee
Yuliya Lierler
2007
Head-Elementary-Set-Free Logic Programs
Proceedings of LPNMR
149–161
10.1007/978-3-540-72200-7_14
Martin Gebser
Marco Maratea
Francesco Ricca
2020
The Seventh Answer Set Programming Competition: Design and Results
TPLP
20
2
176–204
10.1017/S1471068419000061
Martin Gebser
Torsten Schaub
Sven Thiele
2007
GrinGo: A New Grounder for Answer Set Programming
Proceedings of LPNMR
266–271
10.1007/978-3-540-72200-7_24
Martin Gebser
Torsten Schaub
Sven Thiele
Philippe Veber
2011
Detecting inconsistencies in large biological networks with answer set programming
TPLP
11
2-3
323–360
10.1017/S1471068410000554
Michael Gelfond
Vladimir Lifschitz
1988
The Stable Model Semantics for Logic Programming
Proceedings of ICLP/SLP
1070–1080
Michael Gelfond
Halina Przymusinska
Vladimir Lifschitz
Miroslaw Truszczynski
1991
Disjunctive Defaults
Proceedings of KR
230–237
Michael Gelfond
Yuanlin Zhang
2014
Vicious Circle Principle and Logic Programs with Aggregates
TPLP
14
4–5
587–601
10.1017/S1471068414000222
Enrico Giunchiglia
Yuliya Lierler
Marco Maratea
2006
Answer Set Programming Based on Propositional Satisfiability
J. Autom. Reasoning
36
4
345–377
10.1007/s10817-006-9033-2
Giovanni Grasso
Salvatore Iiritano
Nicola Leone
Francesco Ricca
2009
Some DLV Applications for Knowledge Management
Proceedings of LPNMR
591–597
10.1007/978-3-642-04238-6_63
LLC Gurobi Optimization
2020
Gurobi Optimizer Reference Manual
Tomi Janhunen
2004
Representing Normal Programs with Clauses
Proceedings of ECAI
358–362
Tomi Janhunen
2018
Cross-Translating Answer Set Programs Using the ASPTOOLS Collection
KI
32
2-3
183–184
10.1007/s13218-018-0529-9
Tomi Janhunen
Martin Gebser
Jussi Rintanen
Henrik J. Nyman
Johan Pensar
Jukka Corander
2017
Learning discrete decomposable graphical models via constraint optimization
Statistics and Computing
27
1
115–130
10.1007/s11222-015-9611-4
Tomi Janhunen
Roland Kaminski
Max Ostrowski
Sebastian Schellhorn
Philipp Wanko
Torsten Schaub
2017
Clingo goes linear constraints over reals and integers
TPLP
17
5-6
872–888
10.1017/S1471068417000242
Tomi Janhunen
Ilkka Niemelä
2011
Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning - Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday
111–130
10.1007/978-3-642-20832-4_8
Tomi Janhunen
Ilkka Niemelä
Mark Sevalnev
2009
Computing Stable Models via Reductions to Difference Logic
LPNMR
142–154
10.1007/978-3-642-04238-6_14
Laura Koponen
Emilia Oikarinen
Tomi Janhunen
Laura Säilä
2015
Optimizing phylogenetic supertrees using answer set programming
TPLP
15
4-5
604–619
10.1017/S1471068415000265
Nicola Leone
Gerald Pfeifer
Wolfgang Faber
Thomas Eiter
Georg Gottlob
Simona Perri
Francesco Scarcello
2006
The DLV system for knowledge representation and reasoning
ACM Trans. Comput. Log.
7
3
499–562
10.1145/1149114.1149117
Yuliya Lierler
2005
cmodels - SAT-Based Disjunctive Answer Set Solver
447–451
10.1007/11546207_44
Yuliya Lierler
2012
On the Relation of Constraint Answer Set Programming Languages and Algorithms
Proceedings of AAAI
Vladimir Lifschitz
1999
Answer Set Planning
Proceedings of ICLP
23–37
Vladimir Lifschitz
Hudson Turner
1994
Splitting a Logic Program
Proceedings of ICLP
23–37
Fangzhen Lin
Jicheng Zhao
2003
On Tight Logic Programs and Yet Another Translation from Normal Logic Programs to Propositional Logic
Proceedings of IJCAI
853–858
Fangzhen Lin
Yuting Zhao
2004
ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers
AIJ
157
1-2
115–137
10.1016/j.artint.2004.04.004
Guohua Liu
Tomi Janhunen
Ilkka Niemelä
2012
Answer Set Programming via Mixed Integer Programming
Proceedings of KR
Guohua Liu
Jia-Huai You
2010
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundam. Inform.
101
3
237–255
10.3233/FI-2010-286
Lengning Liu
Miroslaw Truszczynski
2005
Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers
Proceedings of LPNMR
410–415
10.1007/11546207_37
Lengning Liu
Mirosław Truszczyński
2006
Properties and Applications of Programs with Monotone and Convex Constraints
J. AI Res. (JAIR)
27
299–334
10.1613/jair.2009
Vasco M. Manquinho
João P. Marques Silva
2006
On Using Cutting Planes in Pseudo-Boolean Optimization
JSAT
2
1-4
209–219
Victor Marek
Ilkka Niemelä
Mirosław Truszczyński
2008
Logic programs with monotone abstract constraint atoms
TPLP
8
2
167–199
10.1017/S147106840700302X
Victor Marek
Mirosław Truszczyński
1999
Stable Models and an Alternative Logic Programming Paradigm
The Logic Programming Paradigm: A 25-Year Perspective
Springer-Verlag
375–398
10.1007/978-3-642-60085-2_17
João P. Marques-Silva
Karem A. Sakallah
1999
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
48
5
506–521
10.1109/12.769433
Hakan Metin
Souheib Baarir
Fabrice Kordon
2019
Composing Symmetry Propagation and Effective Symmetry Breaking for SAT Solving
Proceedings of NFM
LNCS
11460
316–332
10.1007/978-3-030-20652-9_21
Ilkka Niemelä
1999
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Ann. Math. Artif. Intell.
25
3-4
241–273
10.1023/A:1018930122475
Monica Nogueira
Marcello Balduccini
Michael Gelfond
Richard Watson
Matthew Barry
2001
An A-Prolog Decision Support System for the Space Shuttle
PADL
169–183
Nikolay Pelov
Marc Denecker
Maurice Bruynooghe
2007
Well-founded and Stable Semantics of Logic Programs with Aggregates
TPLP
7
3
301–353
10.1017/S1471068406002973
Francesco Ricca
Antonella Dimasi
Giovanni Grasso
Salvatore Maria Ielpa
Salvatore Iiritano
Marco Manna
Nicola Leone
2010
A Logic-Based System for e-Tourism
Fundam. Inform.
105
1-2
35–55
10.3233/FI-2010-357
Francesca Rossi
Peter van Beek
Toby Walsh
2006
Handbook of Constraint Programming
Foundations of Artificial Intelligence
2
Elsevier
Olivier Roussel
Vasco M. Manquinho
2009
Pseudo-Boolean and Cardinality Constraints
Armin Biere
Marijn Heule
Hans van Maaren
Toby Walsh
Handbook of Satisfiability
Frontiers in Artificial Intelligence and Applications
185
IOS Press
695–733
10.3233/978-1-58603-929-5-695
Hossein M. Sheini
Karem A. Sakallah
2006
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
JSAT
2
1-4
165–189
Da Shen
Yuliya Lierler
2018
SMT-Based Constraint Answer Set Solver EZSMT+ for Non-Tight Programs
Proceedings of KR
67–71
G. Sierksma
P. van Dam
G.A. Tijssen
1996
Linear and integer programming: theory and practice
Monographs and textbooks in pure and applied mathematics
Dekker
Patrik Simons
Ilkka Niemelä
Timo Soininen
2002
Extending and implementing the stable model semantics
AIJ
138
1-2
181–234
10.1016/S0004-3702(02)00187-X
Tran Cao Son
Enrico Pontelli
Islam Elkabani
2006
An Unfolding-Based Semantics for Logic Programming with Aggregates
CoRR
abs/cs/0605038
Peter J. Stuckey
2010
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Proceedings of CPAIOR
5–9
10.1007/978-3-642-13520-0_3
Tommi Syrjänen
2000
Lparse 1.0 User's Manual
http://www.tcs.hut.fi/Software/smodels/lparse.ps.gz
Juha Tiihonen
Timo Soininen
Ilkka Niemelä
Reijo Sulonen
2003
A practical tool for mass-customising configurable products
Proceedings ICED
1290–1299
Joost Vennekens
David Gilis
Marc Denecker
2006
Splitting an operator: Algebraic modularity results for logics with fixpoint semantics
ACM Trans. Comput. Log.
7
4
765–797
10.1145/1182613.1189735
Marc Vinyals
Jan Elffers
Jesús Giráldez-Cru
Stephan Gocht
Jakob Nordström
2018
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving
Proceedings of SAT
292–310
10.1007/978-3-319-94144-8_18