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

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

Все темы | Новая тема  Стр.14 (39) << < Пред. | След. > >>    Поиск:
Автор	Тема: На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:07 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =157=> 0923p Effective Query Rewriting with Ontologies over DBoxes, E.Franconi, Inanç Seylan, Jos de Bruijn, http://ijcai.org/papers09/Abstracts/157.html We consider query answering on Description Logic (DL) ontologies with DBoxes, where a DBox is a set of assertions on individuals involving atomic concepts and roles called DBox predicates. The extension of a DBox predicate is exactly defined in every interpretation by the contents of the DBox, i.e., a DBox faithfully represents a database whose table names are the DBox predicates and the tuples are the DBox assertions. Our goals are (i) to find out whether the answers to a given query are solely determined by the DBox predicates and, if so, (ii) to find a rewriting of the query in terms of them. The resulting query can then be efficiently evaluated using standard database technology. We have that (i) can be reduced to entailment checking and (ii) can be reduced to finding an interpolant. We present a procedure for computing interpolants in the DL ALC with general TBoxes. We extend the procedure with standard tableau optimisations, and we discuss abduction as a technique for amending ontologies to gain definability of queries of interest. text: http://ijcai.org/papers09/Papers/IJCAI09-157.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:08 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =158=> 0930p Negotiation Using Logic Programming with Consistency Restoring Rules, Tran Cao Son, Chiaki Sakama, http://ijcai.org/papers09/Abstracts/158.html We formalize negotiations using logic programming with consistency restoring rules (or CRProlog) [Balduccini and Gelfond, 2003]. Our formulation deals with incomplete information, preferences, and changing goals. We assume that each agent is equipped with a knowledge base for negotiation which consists of a CR-program, a set of possible assumptions, and a set of ordered goals. We use the notion of an answer set as a means to formalize the basic notions of negotiation such as proposal, response, negotiation, negotiation tree (protocol), etc. and discuss their properties. text: http://ijcai.org/papers09/Papers/IJCAI09-158.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:08 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =159=> 0936p Realising Deterministic Behavior from Multiple Non-Deterministic Behaviors, Thomas Ströder, Maurice Pagnucco, http://ijcai.org/papers09/Abstracts/159.html This paper considers the problem of composing or scheduling several (non-deterministic) behaviors so as to conform to a specified target behavior as well as satisfying constraints imposed by the environment in which the behaviors are to be performed. This problem has already been considered by several works in the literature and applied to areas such as web service composition, the composition of robot behaviors and co-ordination of distributed devices. We develop a sound and complete algorithm for determining such a composition which has a number of significant advantages over previous proposals: a) our algorithm is different from previous proposals which resort to dynamic logic or simulation relations, b) we realized an implementation in Java as opposed to other approaches for which there are no known implementations, c) our algorithm determines all possible schedulers at once, and d) we can use our framework to define a notion of approximation when the target behavior cannot be realized. text: http://ijcai.org/papers09/Papers/IJCAI09-159.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:08 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =160=> 0942p Declarative Programming of Search Problems with Built-in Arithmetic, Eugenia Ternovska, David G. Mitchell, http://ijcai.org/papers09/Abstracts/160.html We address the problem of providing a logical formalization of arithmetic in declarative modelling languages for NP search problems. The challenge is to simultaneously allow quantification over an infinite domain such as the natural numbers, provide natural modelling facilities, and control expressive power of the language. To address the problem, we introduce an extension of the model expansion (MX) based framework to finite structures embedded in an infinite secondary structure, together with "double-guarded" logics for representing MX specifications for these structures. The logics also contain multi-set functions (aggregate operations). Our main result is that these logics capture the complexity class NP on "small-cost" arithmetical structures. text: http://ijcai.org/papers09/Papers/IJCAI09-160.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:08 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =161=> 0948p Applications and Extensions of PTIME Description Logics with Functional Constraints, David Toman, Grant Weddell, http://ijcai.org/papers09/Abstracts/161.html We review and extend earlier work on the logic CFD, a description logic that allows terminological cycles with universal restrictions over functional roles. In particular, we consider the problem of reasoning about concept subsumption and the problem of computing certain answers for a family of attribute-connected conjunctive queries, showing that both problems are in PTIME. We then consider the effect on the complexity of these problems after adding a concept constructor that expresses concept union, or after adding a concept constructor for the bottom class. Finally, we show that adding both constructors makes both problems EXPTIME-complete. text: http://ijcai.org/papers09/Papers/IJCAI09-161.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:08 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =162=> 0955p Knowing More — from Global to Local Correspondence, Hans van Ditmarsch, Wiebe van der Hoek, Barteld Kooi, http://ijcai.org/papers09/Abstracts/162.html Modal correspondence theory is a powerful and effective way to guarantee that adding specific syntactic axioms to a modal logic is mirrored by requiring ‘corresponding’ properties of the underlying Kripke models. However, such axioms not only quantify over all formulas, but they are also global in the sense that the corresponding semantic property is assumed to hold for all states. However, in for instance epistemic logic one would like to have the flexibility to say that certain properties (like ‘agent b knows at least what agent a knows’) are true locally in a specific state, but not necessarily globally, in all states. This would enable one to say ‘currently, b knows at least what a knows, but this is not common knowledge’, or ‘. . . but this is not always true’, or ‘. . . but this could be changed by action α’. We offer a logic for ‘knowing at least as’, where the (global) axiom schemeKaϕ → Kbϕ is replaced by a (local) inference rule. We give a complete modal system, and discuss some consequences of the axiom in an epistemic setting. Our completeness proof also suggests how achieving such local properties can be generalized to other axioms schemes and modal logics. text: http://ijcai.org/papers09/Abstracts/162.html [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:08 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =163=> 0961p Efficient Inference for Expressive Comparative Preference Languages, Nic Wilson, http://ijcai.org/papers09/Abstracts/163.html A fundamental task for reasoning with preferences is the following: given inputpreference information from a user, and outcomes α and β, should we infer that the user will prefer α to β? For CP-nets and related comparative preference formalisms, inferring a preference of α over β using the standard definition of derived preference appears to be extremely hard, and has been proved to be PSPACE-complete in general for CP-nets. Such inference is also rather conservative, only making the assumption of transitivity. This paper defines a less conservative approach to inference which can be applied for very general forms of input. It is shown to be efficient for expressive comparative preference languages, allowing comparisons between arbitrary partial tuples (including complete assignments), and with the preferences being ceteris paribus or not. text: http://ijcai.org/papers09/Papers/IJCAI09-163.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:09 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC: =164=> 0967p On Combinations of Binary Qualitative Constraint Calculi, Stefan Woelfl, Matthias Westphal, http://ijcai.org/papers09/Abstracts/164.html Qualitative constraint calculi are representation formalisms that allow for efficient reasoning about spatial and temporal information. Many of the calculi discussed in the field of Qualitative Spatial and Temporal Reasoning can be defined as combinations of other, simpler and more compact formalisms. On the other hand, existing calculi can be combined to a new formalism in which one can represent, and reason about, different aspects of a domain at the same time. For example, Gerevini and Renz presented a loose combination of the region connection calculus RCC-8 and the point algebra: the resulting formalism integrates topological and qualitative size relations between spatially extended objects. In this paper we compare the approach by Gerevini and Renz to a method that generates a new qualitative calculus by exploiting the semantic interdependencies between the component calculi. We will compare these two methods and analyze some formal relationships between a combined calculus and its components. The paper is completed by an empirical case study in which the reasoning performance of the suggested methods is compared on random test instances. text: http://ijcai.org/papers09/Papers/IJCAI09-164.pdf [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:09 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC... [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:09 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC... [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:09 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC... [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:09 PART-3: KNOWLEDGE REPRESENTATION, REASONING, and LOGIC... [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:10 [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:10 [Ответ][Цитата]
Capt.Drew Сообщений: 4179	На: Ai Drew :: IJCAI 09 :: Междунар. ии конфа: Позднее лето-2009 - Коротко о Главном Добавлено: 21 авг 09 7:10 [Ответ][Цитата]
Стр.14 (39): 1  ...  10  11  12  13  [14]  15  16  17  18  ...  39 << < Пред. | След. > >>