15225
2004
2004
eng
article
1
--
--
--
On Computing belief change operations using quantifield boolean formulas
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
0955-792X
allegro:1991-2014
10096930
Journal of logic and computation. - ISSN 0955-792X. - 14 (2004), 6, S. 801 - 826
James Patrick Delgrande
Torsten H. Schaub
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
18140
2001
2001
eng
article
1
--
--
--
On computing solutions to belief change scenarios
3-540- 42464-4
allegro:1991-2014
10093902
Symbolic and quantitative approaches to reasoning with uncertainty : 6th European conference, ECSQARU 2001, Toulouse, France, September 19 - 21, 2001 ; proceedings / Hrsg.: Salem Benferhat ; Philippe Besnard. - Berlin [u.a.] : Springer, 2001. - (Lecture notes in computer science ; 2143 : Lecture notes in artificial intelligence). - ISBN 3-540- 42464-4. - S. 510 - 521
James Patrick Delgrande
Torsten H. Schaub
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Institut für Informatik
11605
2006
2006
eng
article
1
--
--
--
A Preference-Based Framework for Updating logic Programs : preliminary reports
http://www.easychair.org/FLoC-06/PREFS-preproceedings.pdf
allegro:1991-2014
10102208
ICLP'06 Workshop : Preferences and their applications in logic programming Systems, PREFS 2006, Seatle, August 16, 2006 ; Proceedings / Hrsg.: E. Pontelli ; T. C. Son. - New Mexico : Univ., 2006. - S. 31 - 44
James Patrick Delgrande
Torsten H. Schaub
Hans Tompits
Institut für Informatik und Computational Science
Institut für Informatik
12420
2007
2007
eng
article
1
--
--
--
A preference-based framework for updating logic programs
978-3-540- 72199-4
allegro:1991-2014
10105916
Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07) / Hrsg.: C. Baral ; G. Brewka ; J. Schlipf. - Heidelberg [u.a.] : Springer, 2007. - ISBN 978-3-540- 72199-4. - S. 71 - 83
James Patrick Delgrande
Torsten H. Schaub
Hans Tompits
Institut für Informatik und Computational Science
Institut für Informatik
12466
2007
2007
eng
article
1
--
--
--
Belief change based on global minimisation
allegro:1991-2014
10105904
Proceedings of the Twentieth International Conference on Artificial Intelligence (IJCAI'07) / Hrsg.: M. Veloso. - Menlo Park : AAAI Press/MIT Press, 2007. - S. 2468 - 2473
James Patrick Delgrande
Jérôme Lang
Torsten H. Schaub
Institut für Informatik und Computational Science
Institut für Informatik
12328
2006
2006
eng
article
1
--
--
--
COBA 2.0 : a consistency-based belief change system
http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf
allegro:1991-2014
10102204
Proceedings of the 11th Workshop on Nonmonotonic Reasoning, NMR 2006, 30 May to 1 Juni 2006, Lakes District, England / Hrsg.: Jürgen Dix ; Anthony Hunter. - Clausthal : Univ., 2006. - (Ifl Technical Report Series ; ifl-06- 04). - S. 267 - 273
James Patrick Delgrande
Daphne H. Liu
Torsten H. Schaub
Sven Thiele
Institut für Informatik und Computational Science
Institut für Informatik
12329
2006
2006
eng
article
1
--
--
--
An Extended Query language for action languages (and its application to aggregates and preferences)
http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf
allegro:1991-2014
10102205
Proceedings of the 11th Workshop on Nonmonotonic Reasoning, NMR 2006, 30 May to 1 Juni 2006, Lakes District, England / Hrsg.: Jürgen Dix ; Anthony Hunter. - Clausthal : Univ., 2006. - (Ifl Technical Report Series ; ifl-06- 04). - S. 362 - 370
James Patrick Delgrande
Torsten H. Schaub
Hans Tompits
Institut für Informatik und Computational Science
Institut für Informatik
13558
2005
2005
eng
article
1
--
--
--
Expressing default logic variants in default logic
Reiter's default logic is one of the best known and most studied of the approaches to nonmonotonic reasoning. Several variants of default logic have subsequently been proposed to give systems with properties differing from the original. In this paper, we examine the relationship between default logic and its major variants. We accomplish this by translating a default theory under a variant interpretation into a second default theory, under the original Reiter semantics, wherein the variant interpretation is respected. That is, in each case we show that, given an extension of a translated theory, one may extract an extension of the original variant default logic theory. We show how constrained, rational, justified, and cumulative default logic can be expressed in Reiter's default logic. As well, we show how Reiter's default logic can be expressed in rational default logic. From this, we suggest that any such variant can be similarly treated. Consequently, we provide a unification of default logics, showing how the original formulation of default logic may express its variants. Moreover, the translations clearly express the relationships between alternative approaches to default logic. The translations themselves are shown to generally have good properties. Thus, in at least a theoretical sense, we show that these variants are in a sense superfluous, in that for any of these variants of default logic, we can exactly mimic the behaviour of a variant in standard default logic. As well, the translations lend insight into means of classifying the expressive power of default logic variants; specifically we suggest that the property of semi-monotonicity represents a division with respect to expressibility, whereas regularity and cumulativity do not
0955-792X
allegro:1991-2014
10103278
Journal of Logic and Computation. - ISSN 0955-792X. - 15 (2005), 5, S. 593-621
James Patrick Delgrande
Torsten H. Schaub
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
14296
2004
2004
eng
article
1
--
--
--
Two approaches to merging knowledge bases
3-540-23242-7
allegro:1991-2014
10096932
Logics in artificial intelligence : 9th European conference ; proceedings ; JELIA 2004, Lisbon, Portugal, September 27 - 30, 2004 / Hrsg..: Jose Julio Alferes ; J. Leite. - Berlin : Springer, 2004. - ISBN: 3-540-23242-7. - (Lecture notes in computer science ; 3229). - S. 426 - 438
James Patrick Delgrande
Torsten H. Schaub
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
14301
2004
2004
eng
article
1
--
--
--
Domain-specific preference for causal reasoning and planning
1-577-35201-7
allegro:1991-2014
10096938
Principles of knowledge reprensentation and reasoning : proceedings of the Ninth International Conference (KR2004) / Hrsg.: Didier Dubois ; C. Welty ; M.A. Williams. - Menlo Cark : AAAI Press, 2004. - ISBN: 1-577-35201-7. - S. 673 - 682
James Patrick Delgrande
Torsten H. Schaub
Hans Tompits
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik