287 research outputs found
Probabilistic entailment in the setting of coherence: The role of quasi conjunction and inclusion relation
In this paper, by adopting a coherence-based probabilistic approach to
default reasoning, we focus the study on the logical operation of quasi
conjunction and the Goodman-Nguyen inclusion relation for conditional events.
We recall that quasi conjunction is a basic notion for defining consistency of
conditional knowledge bases. By deepening some results given in a previous
paper we show that, given any finite family of conditional events F and any
nonempty subset S of F, the family F p-entails the quasi conjunction C(S);
then, given any conditional event E|H, we analyze the equivalence between
p-entailment of E|H from F and p-entailment of E|H from C(S), where S is some
nonempty subset of F. We also illustrate some alternative theorems related with
p-consistency and p-entailment. Finally, we deepen the study of the connections
between the notions of p-entailment and inclusion relation by introducing for a
pair (F,E|H) the (possibly empty) class K of the subsets S of F such that C(S)
implies E|H. We show that the class K satisfies many properties; in particular
K is additive and has a greatest element which can be determined by applying a
suitable algorithm
Argument-based agreements in agent societies
In this paper, we present an abstract argumentation framework for the support of agreement processes
in agent societies. It takes into account arguments, attacks among them, and the social context of the
agents that put forward arguments. Then, we de¿ne the semantics of the framework, providing a
mechanism to evaluate arguments in view of other arguments posed in the argumentation process. We
also provide a translation of the framework into a neural network that computes the set of acceptable
arguments and can be tuned to give more or less importance to argument attacks. Finally, the
framework is illustrated with an example in a real domain of a water-rights transfer market.
& 2011 Elsevier B.V. All rights reservedThis work is supported by the Spanish government Grants CONSOLIDER INGENIO 2010 CSD2007-00022, TIN2008-04446 and TIN2009-13839-C03-01 and by the GVA project PROMETEO 2008/051.Heras Barberá, SM.; Botti Navarro, VJ.; Julian Inglada, VJ. (2012). Argument-based agreements in agent societies. Neurocomputing. 75(1):156-162. doi:10.1016/j.neucom.2011.02.022S15616275
A survey of large-scale reasoning on the Web of data
As more and more data is being generated by sensor networks, social media and organizations, the Webinterlinking this wealth of information becomes more complex. This is particularly true for the so-calledWeb of Data, in which data is semantically enriched and interlinked using ontologies. In this large anduncoordinated environment, reasoning can be used to check the consistency of the data and of asso-ciated ontologies, or to infer logical consequences which, in turn, can be used to obtain new insightsfrom the data. However, reasoning approaches need to be scalable in order to enable reasoning over theentire Web of Data. To address this problem, several high-performance reasoning systems, whichmainly implement distributed or parallel algorithms, have been proposed in the last few years. Thesesystems differ significantly; for instance in terms of reasoning expressivity, computational propertiessuch as completeness, or reasoning objectives. In order to provide afirst complete overview of thefield,this paper reports a systematic review of such scalable reasoning approaches over various ontologicallanguages, reporting details about the methods and over the conducted experiments. We highlight theshortcomings of these approaches and discuss some of the open problems related to performing scalablereasoning
Knowledge perspectives in data grids
In this paper a methodology for accesing scientific data repositories on data grids is proposed. This methodology is based on ontology specification and knowledge representation. The concept of Knowledge Perspective is introduced, as the action of applying particular scientific conjectures or theories to the interpretation of experimental data and information. Data grid environments provide high levels of security and virtualization, which allow the users to create new data services on the data server side. These new services are based on the user’s knowledge perspective. An implementation of this concept is presented, on a Globus-enabled Java execution platform.IFIP International Conference on Artificial Intelligence in Theory and Practice - Knowledge Acquisition and Data MiningRed de Universidades con Carreras en Informática (RedUNCI
Quasi Conjunction, Quasi Disjunction, T-norms and T-conorms: Probabilistic Aspects
We make a probabilistic analysis related to some inference rules which play
an important role in nonmonotonic reasoning. In a coherence-based setting, we
study the extensions of a probability assessment defined on conditional
events to their quasi conjunction, and by exploiting duality, to their quasi
disjunction. The lower and upper bounds coincide with some well known t-norms
and t-conorms: minimum, product, Lukasiewicz, and Hamacher t-norms and their
dual t-conorms. On this basis we obtain Quasi And and Quasi Or rules. These are
rules for which any finite family of conditional events p-entails the
associated quasi conjunction and quasi disjunction. We examine some cases of
logical dependencies, and we study the relations among coherence, inclusion for
conditional events, and p-entailment. We also consider the Or rule, where quasi
conjunction and quasi disjunction of premises coincide with the conclusion. We
analyze further aspects of quasi conjunction and quasi disjunction, by
computing probabilistic bounds on premises from bounds on conclusions. Finally,
we consider biconditional events, and we introduce the notion of an
-conditional event. Then we give a probabilistic interpretation for a
generalized Loop rule. In an appendix we provide explicit expressions for the
Hamacher t-norm and t-conorm in the unitary hypercube
Reasoning with Partial Knowledge
We investigate how sociological argumentation differs from the classical first-order logic. We focus on theories about age dependence of organizational mortality. The overall pattern of argument does not comply with the classical monotonicity principle: adding premises does not overturn conclusions in an argument. The cause of nonmonotonicity is the need to derive conclusions from partial knowledge. We identify meta-principles that appear to guide the observed sociological argumentation patterns, and we formalize a semantics to represent them. This semantics yields a new kind of logical consequence relation. We demonstrate that this new logic can reproduce the results of informal sociological theorizing and lead to new insights. It allows us to unify existing theory fragments and paves the way towards a complete classical theory
Management of Knowledge Representation Standards Activities
This report describes the efforts undertaken over the last two years to identify the issues underlying the current difficulties in sharing and reuse, and a community wide initiative to overcome them. First, we discuss four bottlenecks to sharing and reuse, present a vision of a future in which these bottlenecks have been ameliorated, and describe the efforts of the initiative's four working groups to address these bottlenecks. We then address the supporting technology and infrastructure that is critical to enabling the vision of the future. Finally, we consider topics of longer-range interest by reviewing some of the research issues raised by our vision
- …