Форум: Проблемы искусственного интеллекта

Регистрация | Вход

Все темы | Новая тема  Стр.11 (39) << < Пред. | След. > >>    Поиск:
Автор	Тема: На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 6:59 PART 3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC... 0652 - 0973 pp [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 6:59 PART-3 [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 6:59 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =114=> 0653p A New Bayesian Approach to Multiple Intermittent Fault Diagnosis, Rui Abreu, Peter Zoeteweij, Arjan J.C. van Gemund, http://ijcai.org/papers09/Abstracts/114.html Logic reasoning approaches to fault diagnosis account for the fact that a component may fail intermittently by introducing a parameter that expresses the probability the component exhibits correct behavior. This component parameter in conjunction with a priori fault probability, is usedin a Bayesian framework to compute the posterior fault candidate probabilities. Usually, information on is not known a priori. While proper estimation of can have a great impact on the diagnostic accuracy, at present, only approximations have been proposed. We present a novel framework, BARINEL, that computes exact estimations of as integral part of the posterior candidate probability computation. BARINEL's diagnostic performance is evaluated for both synthetic and real software systems. Our results show that our approach is superior to approaches based on classical persistent fault models as well as previously proposed intermittent fault models. text: http://ijcai.org/papers09/Papers/IJCAI09-114.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 6:59 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =115=> 0659p A Logic for Coalitions with Bounded Resources, Natasha Alechina, Brian Logan, Hoang Nga Nguyen, Abdur Rakib, http://ijcai.org/papers09/Abstracts/115.html Recent work on Alternating-Time Temporal Logic and Coalition Logic has allowed the expression of many interesting properties of coalitions and strategies. However there is no natural way of expressing resource requirements in these logics. This paper presents a Resource-Bounded Coalition Logic (RBCL) which has explicit representation of resource bounds in the language, and gives a complete and sound axiomatisation of RBCL. text: http://ijcai.org/papers09/Papers/IJCAI09-115.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 6:59 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =116=> 0665p Repairing Preference-Based Argumentation Frameworks, Leila Bahia Amgoud, Srdjan Vesic, http://ijcai.org/papers09/Abstracts/116.html Argumentation is a reasoning model based on the construction and evaluation of arguments. Dung has proposed an abstract argumentation framework in which arguments are assumed to have the same strength. This assumption is unfortunately not realistic. Consequently, three main extensions of the framework have been proposed in the literature. The basic idea is that if an argument is stronger than its attacker, the attack fails. The aim of the paper is twofold: First, it shows that the three extensions of Dung framework may lead to unintended results. Second, it proposes a new approach that takes into account the strengths of arguments, and that ensures sound results. We start by presenting two minimal requirements that any preference-based argumentation framework should satisfy, namely the conflict-freeness of arguments extensions and the generalization of Dung’s framework. Inspired from works on handling inconsistency in knowledge bases, the proposed approach defines a binary relation on the powerset of arguments. The maximal elements of this relation represent the extensions of the new framework. text: http://ijcai.org/papers09/Papers/IJCAI09-116.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 6:59 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =117=> 0671p Which Semantics for Neighbourhood Semantics?, Carlos Areces, Diego Figueira, http://ijcai.org/papers09/Abstracts/117.html In this article we discuss two alternative proposals for neighbourhood semantics (which we call strict and loose neighbourhood semantics, NSS and NSL respectively) that have been previously introduced in the literature. Our main tools are suitable notions of bisimulation. While an elegant notion of bisimulation exists for NSL, the required bisimulation for NSS is rather involved. We propose a simple extension of NSS with a universal modality that we call NSS(E), which comes together with a natural notion of bisimulation. We also investigate the complexity of the satisfiability problem for NSL and NSS(E). text: http://ijcai.org/papers09/Papers/IJCAI09-117.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:00 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =118=> 0677p Extending Decidable Cases for Rules with Existential Variables, Jean-François Baget, M.Leclère, Marie-Laure Mugnier, E.Salvat, http://ijcai.org/papers09/Abstracts/118.html In rules considered in this paper, the conclusion may contain existentially quantified variables, which makes reasoning tasks (as deduction) non-decidable. These rules have the same logical form as TGD (tuple generating dependencies) in databases and as conceptual graph rules. We extend known decidable cases by combining backward and forward chaining schemes, in association with a graph that captures exactly the notion of dependency between rules. Finally, we draw a map of known decidable cases, including an extension obtained by combining our approach with very recent results on TGD. text: http://ijcai.org/papers09/Papers/IJCAI09-118.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:00 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =119=> 0683p Computational Properties of Resolution-based Grounded Semantics, Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin, http://ijcai.org/papers09/Abstracts/119.html In the context of Dung's theory of abstract argumentation frameworks, the recently introduced resolution-based grounded semantics features the unique property of fully complying with a set of general requirements, only partially satisfied by previous literature proposals. This paper contributes to the investigation of resolution-based grounded semantics by analyzing its computational properties with reference to a standard set of decision problems for abstract argumentation semantics: (a) checking the property of being an extension for a set of arguments; (b) checking agreement with traditional grounded semantics; (c) checking the existence of a non-empty extension; (d) checking credulous acceptance of an argument; (e) checking skeptical acceptance of an argument. It is shown that problems (a)-(c) admit polynomial time decision processes, while (d) is NP-complete and (e) coNP-complete. text: http://ijcai.org/papers09/Papers/IJCAI09-119.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:00 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =120=> 0690p An Argumentation-Based Interpreter for Golog Programs, Michelle Blom, Adrian Pearce, http://ijcai.org/papers09/Abstracts/120.html This paper presents an argumentation-based interpreter for Golog programs. Traditional Golog interpreters are not designed to find the most preferred executions of a program from the perspective of an agent. Existing techniques developed to discover these executions are limited in terms of how the preferences of an agent can be expressed, and the variety of preference types that can be used to guide search for a solution. The presented work combines the use of argumentation to compare executions relative to a set of general comparison principles, and the theory behind best first search to reduce the cost of the search process. To the best of our knowledge this is the first work to integrate argumentation and the interpretation of Golog programs, and to use argumentation as a tool for best first search. text: http://ijcai.org/papers09/Papers/IJCAI09-120.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:00 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =121=> 0696p Defeasible Inclusions in Low-Complexity DLs: Preliminary Notes, Piero A. Bonatti, Marco Faella, Luigi Sauro, http://ijcai.org/papers09/Abstracts/121.html We analyze the complexity of reasoning with circumscribed low-complexity DLs such as DL-lite and the EL family, under suitable restrictions on the use of abnormality predicates. We prove that in circumscribed DL-lite<sub>R</sub> complexity drops from NExp<sup>NP</sup> to the second level of the polynomial hierarchy. In EL, reasoning remains ExpTime-hard, in general. However, by restricting the possible occurrences of existential restrictions, we obtain membership in Sigma<sup>p<sub>2</sub></sup> and Pi<sup>p<sub>2</sub></sup> for an extension of EL. text: http://ijcai.org/papers09/Papers/IJCAI09-121.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:00 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =122=> 0702p Next Steps in Propositional Horn Contraction, Richard Booth, Thomas Meyer, Ivan José Varzinczak, http://ijcai.org/papers09/Abstracts/122.html Standard belief contraction assumes an underlying logic containing full classical propositional logic, but there are good reasons for considering contraction in less expressive logics. In this paper we focus on Horn logic. In addition to being of interest in its own right, our choice is motivated by the use of Horn logic in several areas, including ontology reasoning in description logics. We consider three versions of contraction: entailment-based and inconsistency-basedcontraction (e-contraction and i-contraction, resp.), introduced by Delgrande for Horn logic, and package contraction (p-contraction), studied by Fuhrmann and Hansson for the classical case. We show that the standard basic form of contraction, partial meet, is too strong in the Horn case. We define more appropriate notions of basic contraction for all three types above, and provide associated representation results in terms of postulates. Our results stand in contrast to Delgrande's conjectures that orderly maxichoice is the appropriate contraction for both e- and i-contraction. Our interest in p-contraction stems from its relationship with an important reasoning task in ontological reasoning:repairing the subsumption hierarchy in EL. This is closely related to p-contraction with sets of basic Horn clauses (Horn clauses of the form p -> q). We show that this restricted version of p-contraction can also be represented as i-contraction. text: http://ijcai.org/papers09/Papers/IJCAI09-122.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:01 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =123=> 0708p Euclidean and Mereological Qualitative Spaces: A Study of SCC and DCC, Stefano Borgo, http://ijcai.org/papers09/Abstracts/123.html We determine the implicit assumptions and the structure of the Single and Double Cross Calculi within Euclidean geometry, and use these results to guide the construction of analogous calculi in mereogeometry. The systems thus obtained have strong semantic and deductive similarities with the Euclidean-based Cross Calculi although they rely on a different geometry. This fact suggests that putting too much emphasis on usual classification of qualitative spaces may hide important commonalities among spaces living in different classes. text: http://ijcai.org/papers09/Papers/IJCAI09-123.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:01 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =124=> 0714p Regular Path Queries in Expressive Description Logics with Nominals, Diego Calvanese, Thomas Eiter, Magdalena Ortiz, http://ijcai.org/papers09/Abstracts/124.html Reasoning over complex queries in the DLs underlying OWL 2 is of importance in several application domains. We provide decidability and (tight) upper bounds for the problem of checking entailment and containment of positive regular path queries under various combinations of constructs used in such expressive DLs; specifically: regular expressions and (safe) Booleans over roles, and allowing for the combination of any two constructs among inverse roles, qualified number restrictions, and nominals. Our results carry over also to the DLs of the SR family, and thus have a direct impact on OWL 2. text: http://ijcai.org/papers09/Papers/IJCAI09-124.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:01 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =125=> 0721p A Symmetry Reduction Technique for Model Checking Temporal-Epistemic Logic, Mika Cohen, Mads Dam, Alessio Lomuscio, Hongyang Qu, http://ijcai.org/papers09/Abstracts/125.html We introduce a symmetry reduction technique for model checking temporal-epistemic properties of multi-agent systems defined in the mainstream interpreted systems framework. The technique, based on counterpart semantics, aims to reduce the set of initial states that need to be considered in a model. We present theoretical results establishing that there are neither false positives nor false negatives in the reduced model. We evaluate the technique by presenting the results of an implementation tested against two well known applications of epistemic logic, the muddy children and the dining cryptographers. The experimental results obtained confirm that the reduction in model checking time can be dramatic, thereby allowing for the verification of hitherto intractable systems. text: http://ijcai.org/papers09/Papers/IJCAI09-125.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:02 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =126=> 0727p Import-by-Query: Ontology Reasoning under Access Limitations, Bernardo Cuenca Grau, Boris Motik, Yevgeny Kazakov, http://ijcai.org/papers09/Abstracts/126.html To enable ontology reuse, the Web Ontology Language (OWL) allows an ontology Kv to import an ontology Kh. To reason with such a Kv, a reasoner needs physical access to the axioms of Kh. For copyright and/or privacy reasons, however, the authors of Kh might not want to publish the axioms of Kh; instead, they might prefer to provide an oracle that can answer a (limited) set of queries over Kh, thus allowing Kv to import Kh "by query." In this paper, we study import-by-query algorithms, which can answer questions about Kv U Kh by accessing only Kv and the oracle. We show that no such algorithm exists in general, and present restrictions under which importing by query becomes feasible. text: http://ijcai.org/papers09/Papers/IJCAI09-126.pdf [Ответ][Цитата]
Стр.11 (39): 1  ...  7  8  9  10  [11]  12  13  14  15  ...  39 << < Пред. | След. > >>