@article{DelgrandeSchaubTompitsetal.2013,
author = {Delgrande, James and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
title = {A model-theoretic approach to belief change in answer set programming},
series = {ACM transactions on computational logic},
volume = {14},
journal = {ACM transactions on computational logic},
number = {2},
publisher = {Association for Computing Machinery},
address = {New York},
issn = {1529-3785 (print)},
doi = {10.1145/2480759.2480766},
pages = {46},
year = {2013},
abstract = {We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model theory of logic programs furnished by SE interpretations, where an SE interpretation is a model of a logic program in the same way that a classical interpretation is a model of a propositional formula. Hence we extend techniques from the area of belief revision based on distance between models to belief change in logic programs. We first consider belief revision: for logic programs P and Q, the goal is to determine a program R that corresponds to the revision of P by Q, denoted P * Q. We investigate several operators, including (logic program) expansion and two revision operators based on the distance between the SE models of logic programs. It proves to be the case that expansion is an interesting operator in its own right, unlike in classical belief revision where it is relatively uninteresting. Expansion and revision are shown to satisfy a suite of interesting properties; in particular, our revision operators satisfy all or nearly all of the AGM postulates for revision. We next consider approaches for merging a set of logic programs, P-1,...,P-n. Again, our formal techniques are based on notions of relative distance between the SE models of the logic programs. Two approaches are examined. The first informally selects for each program P-i those models of P-i that vary the least from models of the other programs. The second approach informally selects those models of a program P-0 that are closest to the models of programs P-1,...,P-n. In this case, P-0 can be thought of as a set of database integrity constraints. We examine these operators with regards to how they satisfy relevant postulate sets. Last, we present encodings for computing the revision as well as the merging of logic programs within the same logic programming framework. This gives rise to a direct implementation of our approach in terms of off-the-shelf answer set solvers. These encodings also reflect the fact that our change operators do not increase the complexity of the base formalism.},
language = {en}
}
@article{BesnardSchaubTompitsetal.2003,
author = {Besnard, Philippe and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
title = {Paraconsistent reasoning via quantified boolean formulas : Part II: Circumscribing inconsistent theories},
isbn = {3-540- 409494-5},
year = {2003},
language = {en}
}
@article{PearceSarsakovSchaubetal.2002,
author = {Pearce, David and Sarsakov, Vladimir and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
title = {A polynomial translation of logic programs with nested expressions into disjunctive logic programs : preliminary report},
year = {2002},
language = {en}
}
@article{PearceSarsakovSchaubetal.2002,
author = {Pearce, David and Sarsakov, Vladimir and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
title = {A polynomial translation of logic programs with nested expressions into disjunctive logic programs},
isbn = {3-540-43930-7},
year = {2002},
language = {en}
}
@article{BesnardSchaubTompitsetal.2002,
author = {Besnard, Philippe and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
title = {Paraconsistent reasoning via quantified boolean formulas},
isbn = {3-540-44190-5},
year = {2002},
language = {en}
}
@article{LinkeTompitsWoltran2004,
author = {Linke, Thomas and Tompits, Hans and Woltran, Stefan},
title = {On Acyclic and head-cycle free nested logic programs},
isbn = {3-540-22671-01},
year = {2004},
language = {en}
}
@article{LinkeTompitsWoltran2004,
author = {Linke, Thomas and Tompits, Hans and Woltran, Stefan},
title = {On acyclic and head-cycle free nested logic programs},
year = {2004},
language = {en}
}
@article{DelgrandeSchaubTompitsetal.2001,
author = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
title = {On computing solutions to belief change scenarios},
isbn = {3-540- 42464-4},
year = {2001},
language = {en}
}
@article{DelgrandeSchaubTompitsetal.2004,
author = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
title = {On Computing belief change operations using quantifield boolean formulas},
issn = {0955-792X},
year = {2004},
abstract = {In this paper, we show how an approach to belief revision and belief contraction can be axiomatized by means of quantified Boolean formulas. Specifically, we consider the approach of belief change scenarios, a general framework that has been introduced for expressing different forms of belief change. The essential idea is that for a belief change scenario (K, R, C), the set of formulas K, representing the knowledge base, is modified so that the sets of formulas R and C are respectively true in, and consistent with the result. By restricting the form of a belief change scenario, one obtains specific belief change operators including belief revision, contraction, update, and merging. For both the general approach and for specific operators, we give a quantified Boolean formula such that satisfying truth assignments to the free variables correspond to belief change extensions in the original approach. Hence, we reduce the problem of determining the results of a belief change operation to that of satisfiability. This approach has several benefits. First, it furnishes an axiomatic specification of belief change with respect to belief change scenarios. This then leads to further insight into the belief change framework. Second, this axiomatization allows us to identify strict complexity bounds for the considered reasoning tasks. Third, we have implemented these different forms of belief change by means of existing solvers for quantified Boolean formulas. As well, it appears that this approach may be straightforwardly applied to other specific approaches to belief change},
language = {en}
}
@article{SarsakovSchaubTompitsetal.2004,
author = {Sarsakov, Vladimir and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
title = {A compiler for nested logic programming},
isbn = {3-540- 20721-x},
year = {2004},
language = {en}
}
@article{BrainGebserPuehreretal.2007,
author = {Brain, Martin and Gebser, Martin and P{\"u}hrer, J{\"o}rg and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
title = {"That is illogical, Captain!" : the debugging support tool spock for answer-set programs ; system description},
year = {2007},
language = {en}
}
@article{GebserSchaubTompitsetal.2007,
author = {Gebser, Martin and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
title = {Alternative characterizations for program equivalence under aswer-set semantics : a preliminary report},
year = {2007},
language = {en}
}
@article{BrainGebserPuehreretal.2007,
author = {Brain, Martin and Gebser, Martin and P{\"u}hrer, J{\"o}rg and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
title = {Debugging ASP programs by means of ASP},
isbn = {978-3-540- 72199-4},
year = {2007},
language = {en}
}
@misc{FichteTruszczynskiWoltran2015,
author = {Fichte, Johannes K. and Truszczynski, Miroslaw and Woltran, Stefan},
title = {Dual-normal logic programs},
series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
journal = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
number = {585},
issn = {1866-8372},
doi = {10.25932/publishup-41449},
url = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-414490},
pages = {16},
year = {2015},
abstract = {Disjunctive Answer Set Programming is a powerful declarative programming paradigm with complexity beyond NP. Identifying classes of programs for which the consistency problem is in NP is of interest from the theoretical standpoint and can potentially lead to improvements in the design of answer set programming solvers. One of such classes consists of dual-normal programs, where the number of positive body atoms in proper rules is at most one. Unlike other classes of programs, dual-normal programs have received little attention so far. In this paper we study this class. We relate dual-normal programs to propositional theories and to normal programs by presenting several inter-translations. With the translation from dual-normal to normal programs at hand, we introduce the novel class of body-cycle free programs, which are in many respects dual to head-cycle free programs. We establish the expressive power of dual-normal programs in terms of SE- and UE-models, and compare them to normal programs. We also discuss the complexity of deciding whether dual-normal programs are strongly and uniformly equivalent.},
language = {en}
}