Sciweavers

NMR
2004
Springer
14 years 3 months ago
Consistency-based approaches to merging knowledge bases: preliminary report
We present a framework for investigating merging operators for belief sets. This framework is a generalisation of our earlier work concerning consistency-based belief revision and...
James P. Delgrande, Torsten Schaub
NMR
2004
Springer
14 years 3 months ago
Preliminary considerations on the modelling of belief change operators by metric spaces
In this paper, a possible worlds framework for representing general belief change operators is presented. In common with many approaches, an agent’s set of beliefs are specifie...
James P. Delgrande
NMR
2004
Springer
14 years 3 months ago
A possibilistic approach to restore consistency in answer set programming
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
NMR
2004
Springer
14 years 3 months ago
Probability, rational belief and belief change
A simple model of rational belief holds that: (i) an instantaneous snapshot of an ideally rational belief system corresponds to a probability distribution; and (ii) rational belie...
Charles G. Morgan
NMR
2004
Springer
14 years 3 months ago
A first approach to argument-based recommender systems based on defeasible logic programming
Recommender systems have evolved in the last years as specialized tools to assist users in a plethora of computermediated tasks by providing guidelines or hints. Most recommender ...
Carlos Iván Chesñevar, Ana Gabriela ...
NMR
2004
Springer
14 years 3 months ago
Dialogues and HY-arguments
This paper introduces a new class called hang yourself (HY) arguments into the theory of defeasible argumentation. The novelty of such arguments is that they are inherently destru...
Martin Caminada
NMR
2004
Springer
14 years 3 months ago
Answer set programming with default logic
We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
Victor W. Marek, Jeffrey B. Remmel
NMR
2004
Springer
14 years 3 months ago
Frame consistency: computing with causal explanations
This paper presents a computational model for reasoning with causal explanations of observations within the framework of Abductive Event Calculus (AEC). The model is based on abdu...
Andrea Bracciali, Antonis C. Kakas
NMR
2004
Springer
14 years 3 months ago
A unifying semantics for belief change
Richard Booth, Samir Chopra, Thomas Andreas Meyer,...
NMR
2004
Springer
14 years 3 months ago
On acyclic and head-cycle free nested logic programs
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
Thomas Linke, Hans Tompits, Stefan Woltran