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

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

Все темы | Новая тема  Стр.12 (39) << < Пред. | След. > >>    Поиск:
Автор	Тема: На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:02 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =127=> 0733p Diagnosing Multiple Persistent and Intermittent Faults, Johan de Kleer, http://ijcai.org/papers09/Abstracts/127.html Almost all approaches to model-based diagnosis presume that the system being diagnosed behaves non-intermittently and analyze behavior over a small number (often only one) of time instants. In this paper we show how existing approaches to model-based diagnosis can be extended to diagnose intermittent failures as they manifest themselves over time. In addition, we show where to insert probe points to best distinguish among the intermittent faults those that best explain the symptoms and isolate the fault in minimum expected cost. text: http://ijcai.org/papers09/Papers/IJCAI09-127.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:02 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =128=> 0739p A Tableaux-Based Method for Computing Least Common Subsumers for Expressive Description Logics, Francesco Maria Donini, Simona Colucci, Tommaso Di Noia, Eugenio Di Sciascio, http://ijcai.org/papers09/Abstracts/128.html Least Common Subsumers (LCS) have been proposed in Description Logics (DL) to capture the commonalities between two or more concepts. Since its introduction in 1992, LCS have been successfully employed as a logical tool for a variety of applications, spanning from inductive learning, to bottom-up construction of knowledge bases, information retrieval, to name a few. The best known algorithm for computing LCS uses structural comparison on normal forms, and the most expressive DL it is applied to is ALEN. We provide a general tableau-based calculus for computing LCS, via substitutions on concept terms containing concept variables. We show the applicability of our method to an expressive DL (but without disjunction and full negation), discuss complexity issues, and show the generality of our proposal. text: http://ijcai.org/papers09/Papers/IJCAI09-128.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:02 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =129=> 0746p A Unified Framework for Representation and Development of Dialectical Proof Procedures in Argumentation, PhanMinh Dung, PhanMinh Thang, http://ijcai.org/papers09/Abstracts/129.html We present an unified methodology for representation and development of dialectical proof procedures in both abstract and assumption-based argumentation based on the notions of legal environments and dispute derivation. A legal environment specifies the legal moves of the dispute parties while a dispute derivation describes the procedure structure. A key insight of this paper is that the opponent moves determine the soundness of a dispute while its completeness depends on the proponent moves. text: http://ijcai.org/papers09/Papers/IJCAI09-129.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:02 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =130=> 0752p Decomposition of Declarative Knowledge Bases with External Functions, Thomas Eiter, Michael Fink, Thomas Krennwallner, http://ijcai.org/papers09/Abstracts/130.html We present a method to decompose a declarative knowledge base, given by a logic program under Answer Set Semantics with access to external sources. It overcomes the ineffectiveness of current methods due to a lack of structural information about these sources, viewed as black boxes, by exploiting independency information in accesses to them. To this end, we develop a generic notion of domain independence that allows to restrict the evaluation domain and, as a consequence, to prune unnecessary dependency assumptions between atoms. This leads to increased decomposability, which we demonstrate by an evaluation method for HEX-programs based on program rewriting. Experiments show that this may yield large performance gains. While developed for a particular formalism, the notions and ideas of this paper might be adapted to related formalisms as well. text: http://ijcai.org/papers09/Papers/IJCAI09-130.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:03 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =131=> 0759p Query Answering in Description Logics with Transitive Roles, Thomas Eiter, Carsten Lutz, Magdalena Ortiz, Mantas Simkus, http://ijcai.org/papers09/Abstracts/131.html We study the computational complexity of conjunctive query answering w.r.t. ontologies formulated in fragments of the description logic SHIQ. Our main result is the identification of two new sources of complexity: the combination of transitive roles and role hierarchies which results in 2ExpTime-hardness, and transitive roles alone which result in coNExpTime-hardness. These bounds complement the existing result that inverse roles make query answering in SHIQ 2ExpTime-hard. We also show that conjunctive query answering with transitive roles, but without inverse roles and role hierarchies, remains in ExpTime if the ABox is tree-shaped. text: http://ijcai.org/papers09/Papers/IJCAI09-131.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:03 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =132=> 0765p Bidirectional Answer Set Programs with Function Symbols, Thomas Eiter, Mantas Simkus, http://ijcai.org/papers09/Abstracts/132.html Current Answer Set Programming (ASP) solvers largely build on Datalog, which, unlike general logic programming, lacks function symbols. This limitation makes ASP decidable, but greatly complicates the modeling of indefinite time, recursive data structures (e.g., lists), and infinite processes and objects in general. Recent research thus aims at finding decidable fragments of ASP with function symbols and studying their complexity. We identify bidirectional ASP programs as an expressive, but yet decidable, language that is useful, e.g., for reasoning about actions involving both the future and the past. We tightly characterize the computational complexity of bidirectional programs and some of their subclasses, addressing the main reasoning tasks. Our results also show that the recently introduced FDNC programs can be extended by inverse rules while retaining decidability, but computational costs are unavoidably higher. text: http://ijcai.org/papers09/Papers/IJCAI09-132.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:03 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =133=> 0772p Knowledge Compilation Properties of Trees-of-BDDs, Revisited, Hélène Fargier, Pierre Marquis, http://ijcai.org/papers09/Abstracts/133.html Recent results have shown the interest of trees-of-BDDs as a suitable target language for propositional knowledge compilation from the practical side. In the present paper, the concept of tree-of-BDDs is extended to additional classes of data structures C, thus leading to trees-of-C representations (ToC). We provide a number of generic results enabling one to determine the queries/transformations satisfied by ToC depending on those satisfied by C. We also present some results about the spatial efficiency of the ToC languages. Focusing on the ToB language (and other related languages), we address a number of issues that remained open in (Subbarayan et al 2007). We show that beyond co and va, the ToB fragment satisfies im and me but satisfies neither cd nor any query among ce, se unlesssf P = NP. Among other results, we prove that ToB is not comparable w.r.t. succinctness with any of cnf, dnf, Dnnf unless the polynomial hierarchy collapses.This contributes to the explanation of some empirical results reported in (Subbarayan et al 2007). text: http://ijcai.org/papers09/Papers/IJCAI09-133.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:03 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =134=> 0778p FRACTAL: Efficient Fault Isolation Using Active Testing, Alexander Feldman, Gregory Provan, Arjan van Gemund, http://ijcai.org/papers09/Abstracts/134.html Model-Based Diagnosis (MBD) approaches often yield a large number of diagnoses, severely limiting their practical utility. This paper presents a novel active testing approach based on MBD techniques, called FRACTAL (FRamework for ACtive Testing ALgorithms), which, given a system description, computes a sequence of control settings for reducing the number of diagnoses. The approach complements probing, sequential diagnosis, and ATPG, and applies to systems where additional tests are restricted to setting a subset of the existing system inputs while observing the existing outputs. This paper evaluates the optimality of FRACTAL, both theoretically and empirically. FRACTAL generates test vectors using a greedy, next-best strategy and a low-cost approximation of diagnostic information entropy. Further, the approximate sequence computed by FRACTAL's greedy approach is optimal over all poly-time approximation algorithms, a fact which we confirm empirically. Extensive experimentation with ISCAS85 combinational circuits shows that FRACTAL reduces the number of remaining diagnoses according to a steep geometric decay function, even when only a fraction of inputs are available for active testing. text: http://ijcai.org/papers09/Papers/IJCAI09-134.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:03 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =135=> 0785p Solving Strong-Fault Diagnostic Models by Model Relaxation, Alexander Feldman, Gregory Provan, Arjan van Gemund, http://ijcai.org/papers09/Abstracts/135.html In Model-Based Diagnosis (MBD), the problem of computing a diagnosis in a strong-fault model (SFM) is computationally much harder than in a weak-fault model (WFM). For example, in propositional Horn models, computing the first minimal diagnosis in a weak-fault model (WFM) is in P but is NP-hard for strong-fault models. As a result, SFM problems of practical significance have not been studied in great depth within the MBD community. In this paper we describe an algorithm that renders the problem of computing a diagnosis in several important SFM subclasses no harder than a similar computation in a WFM. We propose an approach for efficiently computing minimal diagnoses for these subclasses of SFM that extends existing conflict-based algorithms like GDE (Sherlock) and CDA*. Experiments on ISCAS85 combinational circuits show (1) inference speedups with CDA* of up to a factor of 8, and (2) an average of 28% reduction in the average conflict size, at the price of an extra low-polynomial-time consistency check for a candidate diagnosis. text: http://ijcai.org/papers09/Papers/IJCAI09-135.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:04 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =136=> 0791p Plausible Repairs for Inconsistent Requirements, Alexander Felfernig, Gerhard Friedrich, Monika Schubert, Monika Mandl, Markus Mairitsch, Erich Teppan, http://ijcai.org/papers09/Abstracts/136.html Knowledge-based recommenders support users in the identification of interesting items from large and potentially complex assortments. In cases where no recommendation could be found for a given set of requirements, such systems propose explanations that indicate minimal sets of faulty requirements. Unfortunately, such explanations are not personalized and do not include repair proposals which triggers a low degree of satisfaction and frequent cancellations of recommendation sessions. In this paper we present a personalized repair approach that integrates the calculation of explanations with collaborative problem solving techniques. In order to demonstrate the applicability of our approach, we present the results of an empirical study that show significant improvements in the accuracy of predictions for interesting repairs. text: http://ijcai.org/papers09/Papers/IJCAI09-136.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:04 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =137=> 0797p Symmetric Splitting in the General Theory of Stable Models, Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz, Ravi Palla, http://ijcai.org/papers09/Abstracts/137.html Splitting a logic program allows us to reduce the task of computing its stable models to similar tasks for smaller programs. This idea is extended here to the general theory of stable models that replaces traditional logic programs by arbitrary first-order sentences and distinguishes between intensional and extensional predicates. We discuss two kinds of splitting: a set of intensional predicates can be split into subsets, and a formula can be split into its conjunctive terms. text: http://ijcai.org/papers09/Papers/IJCAI09-137.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:04 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =138=> 0804p On the Accrual of Arguments in Defeasible Logic Programming, Mauro Javier Gómez Lucero, Carlos Iván Chesñevar, Guillermo Ricardo Simari, http://ijcai.org/papers09/Abstracts/138.html Recently, the notion of accrual of arguments has received some attention from the argumentation community. Three principles for argument accrual have been identified as necessary to hold in argumentation frameworks. In this paper we propose an approach to model the accrual of arguments in the context of Defeasible Logic Programming, a logic programming approach to argumentation which has proven to be successful for many real-world applications. We will analyze the above mentioned principles in the context of our proposal, studying other interesting properties. text: http://ijcai.org/papers09/Papers/IJCAI09-138.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:04 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =139=> 0810p Evaluating Abductive Hypotheses using an EM Algorithm on BDDs, Katsumi Inoue, Taisuke Sato, Masakazu Ishihata, Yoshitaka Kameya, Hidetomo Nabeshima, http://ijcai.org/papers09/Abstracts/139.html Abductive inference is an important AI reasoning technique to find explanations of observations, and has recently been applied to scientific discovery. To find best hypotheses among many logically possible hypotheses, we need to evaluate hypotheses obtained from the process of hypothesis generation. We propose an abductive inference architecture combined with an EM algorithm working on binary decision diagrams (BDDs). This work opens a way of applying BDDs to compress multiple hypotheses and to select most probable ones from them. An implemented system has been applied to inference of inhibition in metabolic pathways in the domain of systems biology. text: http://ijcai.org/papers09/Papers/IJCAI09-139.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:04 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =140=> 0816p Answer-Set Programming with Bounded Treewidth, Michael Jakl, Reinhard Pichler, Stefan Woltran, http://ijcai.org/papers09/Abstracts/140.html In this paper, we present a novel approach to the evaluation of propositional answer-set programs. In particular, for programs with bounded treewidth, our algorithm is capable of (i) computing the number of answer sets in linear time and (ii) enumerating all answer sets with linear delay. Our algorithm relies on dynamic programming, which so far has not been applied to ASP-problems. Therefore, our approach significantly differs from standard ASP-systems which implement techniques stemming from SAT or CSP, and thus usually do not exploit fixed parameter properties of the programs. We provide first experimental results which underline that, for programs with low treewidth, already a prototypical implementation is competitive compared to state-of-the-art systems. text: http://ijcai.org/papers09/Papers/IJCAI09-140.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:04 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =141=> 0823p Circumscriptive Event Calculus as Answer Set Programming, Tae-Won Kim, Joohyung Lee, Ravi Palla, http://ijcai.org/papers09/Abstracts/141.html Recently, Ferraris, Lee and Lifschitz presented a general definition of a stable model that is similar to the definition of circumscription, and can even be characterized in terms of circumscription. In this paper, we show the opposite direction, which is, how to turn circumscription into the general stable model semantics, and based on this, how to turn circumscriptive event calculus into answer set programs. The reformulation of the event calculus in answer set programming allows answer set solvers to be applied to event calculus reasoning, handling more expressive reasoning tasks than the current SAT-based approach. Our experiments also show clear computational advantages of the answer set programming approach. text: http://ijcai.org/papers09/Papers/IJCAI09-141.pdf [Ответ][Цитата]
Стр.12 (39): 1  ...  8  9  10  11  [12]  13  14  15  16  ...  39 << < Пред. | След. > >>