Considering the current state in service-robotics, an expert is still necessary to add new tasks and execution behaviors by textual and error-prone programming. Under the consideration that humans typically execute sa...
详细信息
Considering the current state in service-robotics, an expert is still necessary to add new tasks and execution behaviors by textual and error-prone programming. Under the consideration that humans typically execute same activities almost identical (or at least similar) and further combine simple behaviors to more complex activities, we follow the constitutive assumption that all complex behaviors are composed of a limited set of atomic behaviors. this work introduces a generic framework for spatial-temporal analysis and classification of arbitrary atomic behaviors. therefore, we propose the combination of Self-Organizing Maps (SOM) and Probabilistic Graphical Models (PGM) in order to exploit the advantages of both concepts. In this work, we describe the essential methods of the framework briefly, whereas the data-driven training of the spatial-temporal model and the reasoning process are described in detail. In order to demonstrate the potential and to emphasize the high level of generalization and flexibility in real-world environments, the framework is evaluated in an exemplary scenario.
Representing and reasoning spatial and temporal information is a key research issue in Computer Science and artificialintelligence. In this paper, we introduce tools that produce three novel encodings which translate...
详细信息
ISBN:
(纸本)9780769549156;9781479902279
Representing and reasoning spatial and temporal information is a key research issue in Computer Science and artificialintelligence. In this paper, we introduce tools that produce three novel encodings which translate problems in qualitative spatial and temporal reasoning into logic programs for answer set programming solvers. Each encoding reflects a different type of modeling abstraction. We evaluate our approach with two of the most well known qualitative spatial and temporal reasoning formalisms, the Interval Algebra and Region Connection Calculus. Our results show some surprising findings, including the strong performance of the solver for disjunctive logic programs over the non-disjunctive ones on our benchmark problems.
We describe a method for abbreviating an analytic classical first-order logic by the introduction of a lemma. Our is based on first computing a compressed representation of present in the analytic proof and then a cut...
详细信息
ISBN:
(纸本)9783642287176
We describe a method for abbreviating an analytic classical first-order logic by the introduction of a lemma. Our is based on first computing a compressed representation of present in the analytic proof and then a cut-formula that
the concept of forgetting has received significant interest in artificialintelligence recently. Informally, given a knowledge base, we may wish to forget about (or discard) some redundant parts (such as atoms, predic...
详细信息
ISBN:
(纸本)9783642287176
the concept of forgetting has received significant interest in artificialintelligence recently. Informally, given a knowledge base, we may wish to forget about (or discard) some redundant parts (such as atoms, predicates, concepts, etc) but still preserve the consequences for certain forms of reasoning. In nonmonotonic reasoning, so far forgetting has been studied only in the context of extension based approaches, mainly answer-set programming. In this paper forgetting is studied in the context of defeasible logic, which is a simple, efficient and sceptical nonmonotonic reasoning approach.
the paper introduces a worst-case optimal tableau algorithm for reasoning with Forest logic Programs, a decidable fragment of Open Answer Set programming. FoLPs are a useful device for tight integration of the Descrip...
详细信息
the TPTP World is a well established infrastructure supporting research, development, and deployment of Automated theorem Proving systems. Recently, the TPTP World has been extended to include a typed first-order logi...
详细信息
ISBN:
(纸本)9783642287176
the TPTP World is a well established infrastructure supporting research, development, and deployment of Automated theorem Proving systems. Recently, the TPTP World has been extended to include a typed first-order logic, which in turn has enabled the integration of arithmetic. this paper describes these developments.
Answer set programming (ASP) and possibility theory can be combined to form possibilistic answer set programming (PASP), a framework for non-monotonic reasoning under uncertainty. Existing proposals view answer sets o...
详细信息
ISBN:
(纸本)9780769549156;9781479902279
Answer set programming (ASP) and possibility theory can be combined to form possibilistic answer set programming (PASP), a framework for non-monotonic reasoning under uncertainty. Existing proposals view answer sets of PASP programs as weighted epistemic states, in which the strength by which different literals are believed to hold may vary. In contrast, in this paper we propose an approach in which epistemic states remain Boolean, but some epistemic states may be considered more plausible than others. A PASP program is then a representation of an incomplete description of these epistemic states where certainties are associated with each rule which is interpreted in terms of a necessity measure. the main contribution of this paper is the introduction of a new semantics for PASP as well as a study of the resulting complexity.
An important goal of research in description logics (DLs) and related logic-based KR formalisms is to identify the worst-case complexity of reasoning. Such results, however, measure the complexity of a logic as a whol...
详细信息
ISBN:
(纸本)9783642287176
An important goal of research in description logics (DLs) and related logic-based KR formalisms is to identify the worst-case complexity of reasoning. Such results, however, measure the complexity of a logic as a whole. For example, reasoning in the basic DL ALCI\mathcal{ALCI} is ExpTime-complete, which means that ALCI\mathcal{ALCI} constructors can be used in a way so that exponential time is strictly required for solving a reasoning problem. It is, however, well known that, given two ALCI\mathcal{ALCI} knowledge bases of roughly the same size, reasoning with one knowledge base may be much more difficult than withthe other, depending on the interaction of the axioms in the KBs. thus, existing worst-case complexity results provide only a very coarse measure of reasoning complexity, and they do not tell us much about the “hardness” of each individual knowledge base.
We present the experience gained from implementing a new decision procedure for both graded and probabilistic modal logic. While our approach uses standard tableaux for propositional connectives, modal rules are given...
详细信息
ISBN:
(纸本)9783642287176
We present the experience gained from implementing a new decision procedure for both graded and probabilistic modal logic. While our approach uses standard tableaux for propositional connectives, modal rules are given by linear constraints on the arguments of operators. the implementation uses binary decision diagrams for propositional connectives and a linear programming library for the modal rules. We compare our implementation, for graded modal logic, with other tools, showing average performance. Due to lack of other implementations, no comparison is provided for probabilistic modal logic, the main new feature of our implementation.
暂无评论