Ringo Baumann (2011):
Splitting an Argumentation Framework.
In: James P. Delgrande & Wolfgang Faber: Logic Programming and Nonmonotonic Reasoning.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 40–53,
doi:10.1007/978-3-642-20895-9_6.
Ringo Baumann, Gerhard Brewka, Wolfgang Dvořák & Stefan Woltran (2012):
Parameterized Splitting: A Simple Modification-Based Approach.
In: Esra Erdem, Joohyung Lee, Yuliya Lierler & David Pearce: Correct Reasoning: Essays on Logic-Based AI in Honour of Vladimir Lifschitz.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 57–71,
doi:10.1007/978-3-642-30743-0_5.
Rachel Ben-Eliyahu & Rina Dechter (1994):
Propositional Semantics For Disjunctive Logic Programs.
Annals of Mathematics and Artificial Intelligence 12,
pp. 53–87,
doi:10.1007/BF01530761.
Minh Dao-Tran, Thomas Eiter, Michael Fink & Thomas Krennwallner (2009):
Modular Nonmonotonic Logic Programming Revisited.
In: Patricia M. Hill & David S. Warren: Logic Programming.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 145–159,
doi:10.1007/978-3-642-02846-5_16.
Martin Davis, George Logemann & Donald Loveland (1962):
A machine program for theorem-proving.
Communications of the ACM 5(7),
pp. 394–397,
doi:10.1145/368273.368557.
Rina Dechter (2003):
Constraint processing.
Morgan Kaufmann.
Edsger W. Dijkstra (1959):
A note on two problems in connexion with graphs.
Numerische mathematik 1(1),
pp. 269–271,
doi:10.1007/BF01386390.
Ariel Felner (2011):
Position paper: Dijkstra's algorithm versus uniform cost search or a case against dijkstra's algorithm.
In: Fourth annual symposium on combinatorial search,
pp. 47–51.
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz & Ravi Palla (2009):
Symmetric splitting in the general theory of stable models.
In: Twenty-First International Joint Conference on Artificial Intelligence,
pp. 797–803.
Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub & Sven Thiele (2008):
Engineering an Incremental ASP Solver.
In: Maria Garcia de la Banda & Enrico Pontelli: Logic Programming.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 190–205,
doi:10.1007/978-3-540-89982-2_23.
Michael Gelfond & Vladimir Lifschitz (1991):
Classical Negation in Logic Programs and Disjunctive Databases.
New Generation Computing 9,
pp. 365–385,
doi:10.1007/BF03037169.
Tomi Janhunen, Emilia Oikarinen, Hans Tompits & Stefan Woltran (2009):
Modularity aspects of disjunctive stable models.
Journal of Artificial Intelligence Research 35,
pp. 813–857,
doi:10.1613/jair.2810.
Jianmin Ji, Hai Wan, Ziwei Huo & Zhenfeng Yuan (2015):
Splitting a Logic Program Revisited.
In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence,
AAAI'15.
AAAI Press,
pp. 1511–1517.
Available at http://dl.acm.org/citation.cfm?id=2886521.2886530.
Vladimir Lifschitz & Hudson Turner (1994):
Splitting a Logic Program..
In: ICLP 94,
pp. 23–37.
Emilia Oikarinen & Tomi Janhunen (2008):
Achieving compositionality of the stable model semantics for smodels programs.
Theory and Practice of Logic Programming 8(5-6),
pp. 717761,
doi:10.1017/S147106840800358X.
Judea Pearl (1984):
Heuristics: intelligent search strategies for computer problem solving.
Addison-Wesley Pub. Co., Inc., Reading, MA.
Bart Selman, David G Mitchell & Hector J Levesque (1996):
Generating hard satisfiability problems.
Artificial intelligence 81(1-2),
pp. 17–29,
doi:10.1016/0004-3702(95)00045-3.
eptcs@eptcs.org