Jérôme Amilhastre, Philippe Janssen & Marie-Catherine Vilarem (1997):
Computing a minimum biclique cover is polynomial for bipartite domino-free graphs.
In: Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms,
pp. 36–42.
Armin Biere, Alessandro Cimatti, Edmund M. Clarke & Yunshan Zhu (1999):
Symbolic model checking without BDDs.
In: Proc. Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99,
pp. 193–207,
doi:10.1007/3-540-49059-0_14.
Avrim L Blum & Merrick L Furst (1997):
Fast planning through planning graph analysis.
Artificial Intelligence 90(1),
pp. 281–300,
doi:10.1016/S0004-3702(96)00047-1.
Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista Ianni, Roland Kaminski, Thomas Krennwallner, Nicola Leone, Francesco Ricca & Torsten Schaub (2015):
ASP-Core-2 Input Language Format.
https://www.mat.unical.it/aspcomp2013/files/ASP-CORE-2.01c.pdf.
ASP Standardization Working Group.
Bernardo Cuteri, Carmine Dodaro, Francesco Ricca & Peter Schüller (2017):
Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis.
TPLP 17(5-6),
pp. 780–799,
doi:10.1017/S1471068417000254.
M. R. Garey & David S. Johnson (1979):
Computers and Intractability: A Guide to the Theory of NP-Completeness.
W. H. Freeman.
Dorit S. Hochbaum (1998):
Approximating clique and biclique problems.
J. Algorithms 29(1),
pp. 174–200,
doi:10.1006/jagm.1998.0964.
Richard Howey, Derek Long & Maria Fox (2004):
VAL: Automatic plan validation, continuous effects and mixed initiative planning using PDDL.
In: Proc. 16th IEEE Int'l Conference on Tools with Artificial Intelligence,
pp. 294–301,
doi:10.1109/ICTAI.2004.120.
Richard M. Karp (1972):
Reducibility among combinatorial problems.
In: Proc. Symposium on the Complexity of Computer Computations, March 20-22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA,
pp. 85–103.
Henry Kautz (2004):
SATPLAN04: Planning as satisfiability.
Working Notes on the Fourth Int'l Planning Competition (IPC-04),
pp. 44–45.
Daphne Koller & Nir Friedman (2009):
Probabilistic Graphical Models - Principles and Techniques.
MIT Press.
Tianyang Ma & Longin Jan Latecki (2012):
Maximum weight cliques with mutex constraints for video object segmentation.
In: Proc. 2012 IEEE Conference on Computer Vision and Pattern Recognition, Providence, RI, USA, June 16-21, 2012,
pp. 670–677,
doi:10.1109/CVPR.2012.6247735.
René Peeters (2003):
The maximum edge biclique problem is NP-complete.
Discrete Applied Mathematics 131(3),
pp. 651–654,
doi:10.1016/S0166-218X(03)00333-0.
Jussi Rintanen (2006):
Compact representation of sets of binary constraints.
In: Proc. 17th European Conference on Artificial Intelligence,
pp. 143–147.
Nathan Robinson, Charles Gretton, Duc Nghia Pham & Abdul Sattar (2008):
A compact and efficient SAT encoding for planning..
In: Proc. International Conference on Automated Planning and Scheduling,
pp. 296–303.
John Michael Robson (1986):
Algorithms for maximum independent sets.
Journal of Algorithms 7(3),
pp. 425–440,
doi:10.1016/0196-6774(86)90032-5.
Anirban Roy & Sinisa Todorovic (2014):
Scene Labeling Using Beam Search under Mutex Constraints.
In: 2014 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2014, Columbus, OH, USA, June 23-28, 2014,
pp. 1178–1185,
doi:10.1109/CVPR.2014.154.
David Spies (2019):
Domain-Independent Cost-Optimal Planning in ASP.
University of Alberta,
Edmonton, Canada.
Mihalis Yannakakis (1978):
Node- and edge-deletion NP-complete problems.
In: Proc. 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA,
pp. 253–264,
doi:10.1145/800133.804355.
eptcs@eptcs.org