TY - JOUR A1 - Gressmann, Jean A1 - Janhunen, Tomi A1 - Mercer, Robert E. A1 - Schaub, Torsten H. A1 - Thiele, Sven A1 - Tichy, Richard T1 - On probing and multi-threading in platypus Y1 - 2006 UR - http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf ER - TY - JOUR A1 - Gressmann, Jean A1 - Janhunen, Tomi A1 - Mercer, Robert E. A1 - Schaub, Torsten H. A1 - Thiele, Sven A1 - Tichy, Richard T1 - On probing and multi-threading in platypus Y1 - 2006 ER - TY - JOUR A1 - Gressmann, Jean A1 - Janhunen, Tomi A1 - Mercer, Robert E. A1 - Schaub, Torsten H. A1 - Thiele, Sven A1 - Tichy, Richard T1 - Platypus : a platform for distributed answer set solving Y1 - 2005 UR - http://www.cs.uni-potsdam.de/wv/pdfformat/grjamescthti05a.pdf ER - TY - JOUR A1 - Besnard, Philippe A1 - Mercer, Robert E. A1 - Schaub, Torsten H. T1 - Optimality theory throught default logic Y1 - 2003 SN - 3-540-20059-2 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Gharib, Mona A1 - Mercer, Robert E. A1 - Risch, V. A1 - Schaub, Torsten H. T1 - Lukaszewicz-style answer set programming : a preliminary report Y1 - 2003 UR - http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-78/ SN - 1613-0073 ER - TY - JOUR A1 - Besnard, Philippe A1 - Mercer, Robert E. A1 - Schaub, Torsten H. T1 - Optimality Theory via Default Logic Y1 - 2002 ER - TY - JOUR A1 - Gebser, Martin A1 - Gharib, Mona A1 - Mercer, Robert E. A1 - Schaub, Torsten H. T1 - Monotonic answer set programming N2 - Answer set programming (ASP) does not allow for incrementally constructing answer sets or locally validating constructions like proofs by only looking at a part of the given program. In this article, we elaborate upon an alternative approach to ASP that allows for incremental constructions. Our approach draws its basic intuitions from the area of default logics. We investigate the feasibility of the concept of semi-monotonicity known from default logics as a basis of incrementality. On the one hand, every logic program has at least one answer set in our alternative setting, which moreover can be constructed incrementally based on generating rules. On the other hand, the approach may produce answer sets lacking characteristic properties of standard answer sets, such as being a model of the given program. We show how integrity constraints can be used to re-establish such properties, even up to correspondence with standard answer sets. Furthermore, we develop an SLD-like proof procedure for our incremental approach to ASP, which allows for query-oriented computations. Also, we provide a characterization of our definition of answer sets via a modification of Clarks completion. Based on this notion of program completion, we present an algorithm for computing the answer sets of a logic program in our approach. Y1 - 2009 UR - http://logcom.oxfordjournals.org/ U6 - https://doi.org/10.1093/logcom/exn040 SN - 0955-792X ER - TY - JOUR A1 - Gharib, Mona A1 - Schaub, Torsten H. A1 - Mercer, Robert E. T1 - Incremental answer set programming : a preliminary report Y1 - 2007 ER -