TY  - JOUR
A1  - Sarsakov, Vladimir
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - A compiler for nested logic programming
Y1  - 2004
SN  - 3-540- 20721-x
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - On Acyclic and head-cycle free nested logic programs
Y1  - 2004
SN  - 3-540-22671-01
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - On acyclic and head-cycle free nested logic programs
Y1  - 2004
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - On Computing belief change operations using quantifield boolean formulas
N2  - 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
Y1  - 2004
SN  - 0955-792X
ER  - 
TY  - BOOK
A1  - Saposhnikov, V. V.
A1  - Saposhnikov, Vl. V.
A1  - Morozov, Alexei
A1  - Gössel, Michael
T1  - Necessary and Sufficient Conditions for the Existence of Self-Checking Circuits ba Use of Complementary Circuits
T3  - Preprint / Universität Potsdam, Institut für Informatik
Y1  - 2004
SN  - 0946-7580
VL  - 2004, 1
PB  - Univ.
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Graphs and cologings for answer set programming : adridged report
Y1  - 2004
SN  - 3-540- 20721-x
ER  - 
TY  - JOUR
A1  - Boesel, Andreas
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Profiling answer set programming : the visualization component of the noMoRe System
Y1  - 2004
SN  - 3-540-23242-7
ER  - 
TY  - BOOK
A1  - Bensch, Suna
A1  - Boldt, Oliver
A1  - Bordihn, Henning
A1  - Jürgensen, Helmut
T1  - Workshop "Formale Methoden der Linguistik" und "14. Theorietag Automaten und Formale Sprachen"
T3  - Preprint / Universität Potsdam, Institut für Informatik
Y1  - 2004
SN  - 0946-7580
VL  - 2004, 2
PB  - Univ.
CY  - Potsdam
ER  - 
TY  - BOOK
A1  - Kytmanov, Alexander M.
A1  - Myslivets, Simona
A1  - Tarkhanov, Nikolai Nikolaevich
T1  - Zeta-function of a nonlinear system
T3  - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell
Y1  - 2004
SN  - 1437-739X
PB  - Univ.
CY  - Potsdam
ER  - 
TY  - BOOK
A1  - Tarkhanov, Nikolai Nikolaevich
T1  - Harmonic integrals on domains with edges
T3  - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell
Y1  - 2004
SN  - 1437-739X
PB  - Univ.
CY  - Potsdam
ER  -