Results 1  10
of
298
LogicBased Merging: the infinite case
"... We extend the results of Konieczny and Pino Pérez (J. Log. and Comp. 2002) concerning merging operators in a finite logical framework to the infinite case (countably many propositional variables). The main result is the representation theorem. Some postulates had to be restated in a new form, equiva ..."
Abstract
 Add to MetaCart
We extend the results of Konieczny and Pino Pérez (J. Log. and Comp. 2002) concerning merging operators in a finite logical framework to the infinite case (countably many propositional variables). The main result is the representation theorem. Some postulates had to be restated in a new form
On the Equivalence of LogicBased Argumentation Systems
 Proceedings of the 5th International Conference on Scalable Uncertainty Management (SUM 2011), volume 6929 of Lecture Notes in Computer Science
, 2011
"... Abstract. Equivalence between two argumentation systems means mainly that the two systems return the same outputs. It can be used for different purposes, namely in order to show whether two systems that are built over the same knowledge base but with distinct attack relations return the same output ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
of the two systems (e.g. their extensions) while the second compares the outputs of their extended versions (i.e. the systems augmented by the same set of arguments). It was shown that only identical systems are equivalent w.r.t. those criteria. In this paper, we study when two logicbased argumentation
Identifying the core of logicbased argumentation systems
 In 23rd International Conference on Tools with Artificial Intelligence (ICTAI’11
, 2011
"... Abstract—We are interested by argumentation systems which build their arguments from a propositional knowledge base (KB), and evaluate them using Dung’s acceptability semantics. We start by showing that such systems are infinite, i.e. from a finite KB, an infinite set of arguments and an infinite se ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
set of attacks among them are generated. While the construction of arguments under propositional logic is costly even in the finite case, the fact that those systems are infinite makes them completely useless. Then, we provide a procedure which, given an argumentation system, computes its finite sub
Merging with Integrity Constraints
, 1999
"... We consider, in this paper, the problem of knowledge base merging with integrity constraints. We propose a logical characterization of those operators and give a representation theorem in terms of preorders on interpretations. We show the close connection between belief revision and merging oper ..."
Abstract

Cited by 53 (11 self)
 Add to MetaCart
We consider, in this paper, the problem of knowledge base merging with integrity constraints. We propose a logical characterization of those operators and give a representation theorem in terms of preorders on interpretations. We show the close connection between belief revision and merging
All from one, one for all: on model checking using representatives
 LNCS
, 1993
"... Checking that a given finite state program satisfies a linear temporal logic property is suffering in many cases from a severe space and time explosion. One way to cope with this is to reduce the state graph used for model checking. We define an equivalence relation between infinite sequences, based ..."
Abstract

Cited by 184 (6 self)
 Add to MetaCart
Checking that a given finite state program satisfies a linear temporal logic property is suffering in many cases from a severe space and time explosion. One way to cope with this is to reduce the state graph used for model checking. We define an equivalence relation between infinite sequences
Merging Knowledge Bases in Possibilistic Logic by Lexicographic Aggregation
"... Belief merging is an important but difficult problem in Artificial Intelligence, especially when sources of information are pervaded with uncertainty. Many merging operators have been proposed to deal with this problem in possibilistic logic, a weighted logic which is powerful for handling inconsist ..."
Abstract
 Add to MetaCart
knowledge base as the result of merging. In such a case, we argue that it is not always necessary to keep weighted information after merging. In this paper, we define a merging operator that maps a set of possibilistic knowledge bases and a formula representing the integrity constraints to a classical
On the Difference between Merging Knowledge Bases and Combining them
, 2000
"... We investigate the logical properties of knowledge base combination operators proposed in the literature. These operators are based on the selection of some maximal subsets of the union of the knowledge bases. We argue that they are not fully satisfactory to merge knowledge bases, since the so ..."
Abstract

Cited by 49 (12 self)
 Add to MetaCart
We investigate the logical properties of knowledge base combination operators proposed in the literature. These operators are based on the selection of some maximal subsets of the union of the knowledge bases. We argue that they are not fully satisfactory to merge knowledge bases, since
Information Integration Using Contextual Knowledge and Ontology Merging
, 2003
"... With the advances in telecommunications, and the introduction of the Internet, information systems achieved physical connectivity, but have yet to establish logical connectivity. Lack of logical connectivity is often inviting disaster as in the case of Mars Orbiter, which was lost because one team u ..."
Abstract

Cited by 51 (7 self)
 Add to MetaCart
With the advances in telecommunications, and the introduction of the Internet, information systems achieved physical connectivity, but have yet to establish logical connectivity. Lack of logical connectivity is often inviting disaster as in the case of Mars Orbiter, which was lost because one team
Belief merging and the discursive dilemma: An argumentbased account to paradoxes of judgment aggregation
 Synthese
, 2006
"... The aggregation of individual judgments on logically interconnected propositions into a collective decision on the same propositions is called judgment aggregation. Literature in social choice and political theory has claimed that judgment aggregation raises serious concerns. For example, consider a ..."
Abstract

Cited by 64 (11 self)
 Add to MetaCart
as the discursive dilemma (or paradox). The discursive dilemma is a serious problem since it is not clear whether a collective outcome exists in these cases, and if it does, what it is like. Moreover, the two suggested escaperoutes from the paradox — the socalled premisebased procedure and the conclusionbased
A SplitCombination Approach to Merging Knowledge Bases in Possibilistic Logic
, 2006
"... In this paper, we propose an adaptive approach to merging possibilistic knowledge bases that deploys multiple operators instead of a single operator in the merging process. The merging approach consists of two steps: one is called the splitting step and the other is called the combination step. T ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
are proposed based on two di#erent splitting methods. Both operators result in a possibilistic knowledge base which contains more information than that obtained by the tconorm (such as the maximum) based merging methods. In the flat case, one of the operators provides a good alternative to syntaxbased
Results 1  10
of
298