Filtern
Erscheinungsjahr
- 2007 (23) (entfernen)
Dokumenttyp
- Ausgabe (Heft) zu einer Zeitschrift (17)
- Diplomarbeit (4)
- Masterarbeit (1)
- Studienarbeit (1)
Sprache
- Englisch (23) (entfernen)
Schlagworte
- Bluetooth (2)
- Campus Information System (2)
- Equality (2)
- Knowledge Compilation (2)
- Theorem Proving (2)
- University (2)
- Adaptive Services Grid (ASG) (1)
- Akzeptanz (1)
- Augmented Reality (1)
- Automated Theorem Proving (1)
- Automated Theorem Proving Systems (1)
- Avatar (1)
- Bayes Procedures (1)
- Bedarfsanalyse (1)
- Bedarfsforschung (1)
- Blog marketing (1)
- Computational biology (1)
- Computeranimation (1)
- Computertomografie (1)
- E-KRHyper (1)
- Enhanced Reality (1)
- Gefühl (1)
- Horn Clauses (1)
- Human motion (1)
- Hyper Tableau Calculus (1)
- IASON (1)
- IT Security (1)
- Industrial-CT (1)
- Internet Voting (1)
- Logistik (1)
- MIA (1)
- MPEG-7 (1)
- Mediator framework (1)
- Motion Capturing (1)
- Multi-robot System (1)
- Multiagent System (1)
- Multidimensional (1)
- Ontology (1)
- Personalised Information Systems (1)
- Petri Nets (1)
- Probability (1)
- Propagation (1)
- RDF Graphs (1)
- Resource Description Framework (RDF) (1)
- Security (1)
- Semantics (1)
- Service-oriented Architectures (SOA) (1)
- Simulationswerkzeug (1)
- Stochastic Logic (1)
- Systembiologie (1)
- Tableau Calculus (1)
- Transferfunction (1)
- Transferfunktion (1)
- UML (1)
- Unified Modeling Language (UML ) (1)
- Virtual characters (1)
- Virtuelle Realität (1)
- Volume Hatching (1)
- Volumen-Rendering (1)
- Web Ontology Language (OWL) (1)
- Web log (1)
- Weblog (1)
- directed acyclic graphs (1)
- finite state automata (1)
- logistic (1)
- multidimensional (1)
- regular dag languages (1)
- requirements analysis (1)
Hyper tableaux with equality
(2007)
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition inference rule, where equations used for paramodulation are drawn (only) from a set of positive unit clauses, the candidate model. The calculus also features a generic, semantically justified simplification rule which covers many redundancy elimination techniques known from superposition theorem proving. Our main results are soundness and completeness, but we briefly describe the implementation, too.
Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to transform a given knowledge base into a special normal form ([MR03],[DH05]), for which queries can be answered efficiently. This precompilation step is very expensive but it only has to be performed once. We propose to apply this technique to knowledge bases defined in Description Logics. For this, we introduce a normal form, called linkless concept descriptions, for ALC concepts. Further we present an algorithm, based on path dissolution, which can be used to transform a given concept description into an equivalent linkless concept description. Finally we discuss a linear satisfiability test as well as a subsumption test for linkless concept descriptions.
In this paper we describe a series of projects on location based and personalised information systems. We start wit a basic research project and we show how we came with the help of two other more application oriented project to a product. This is developed by a consortium of enterprises and it already is in use in the city of Koblenz.
Networked RDF graphs
(2007)
Networked graphs are defined in this paper as a small syntactic extension of named graphs in RDF. They allow for the definition of a graph by explicitly listing triples as well as by SPARQL queries on one or multiple other graphs. By this extension it becomes possible to define a graph including a view onto other graphs and to define the meaning of a set of graphs by the way they reference each other. The semantics of networked graphs is defined by their mapping into logic programs. The expressiveness and computational complexity of networked graphs, varying by the set of constraints imposed on the underlying SPARQL queries, is investigated. We demonstrate the capabilities of networked graphs by a simple use case.
Probability propagation nets
(2007)
A class of high level Petri nets, called "probability propagation nets", is introduced which is particularly useful for modeling probability and evidence propagation. These nets themselves are well suited to represent the probabilistic Horn abduction, whereas specific foldings of them will be used for representing the flows of probabilities and likelihoods in Bayesian networks.
This paper describes the development of security requirements for non-political Internet voting. The practical background is our experience with the Internet voting within the Gesellschaft für Informatik (GI - Informatics Society) 2004 and 2005. The theoretical background is the international state-of-the-art of requirements about electronic voting, especially in the US and in Europe. A focus of this paper is on the user community driven standardization of security requirements by means of a Protection Profile of the international Common Criteria standard.
SOA-Security
(2007)
This paper is a part of the ASG project (Adaptive Services Grid) and addresses some IT security issues of service oriented architectures. It defines a service-oriented security concept, it explores the SOA security challenge, it describes the existing WS-Security standard, and it undertakes a first step into a survey on best practice examples. In particular, the ASG middleware platform technology (JBossWS) is analyzed with respect to its ability to handle security functions.
In Silico simulation of biological systems is an important sub area of computational biology (system biology), and becomes more and more an inherent part for research. Therefore, different kinds of software tools are required. At present, a multitude of tools for several areas exists, but the problem is that most of the tools are essentially application specific and cannot be combined. For instance, a software tool for the simulation of biochemical processes is not able to interact with tools for the morphology simulation and vice versa. In order to obtain realistic results with computer-aided simulations it is important to regard the biological system in its entirety. The objective is to develop a software framework, which provides an interface structure to combine existing simulation tools, and to offer an interaction between all affiliated systems. Consequently, it is possible to re-use existing models and simulation programs. Additionally, dependencies between those can be defined. The system is designed to interoperate as an extendable architecture for various tools. The thesis shows the usability and applicability of the software and discusses potential improvements.
The E-KRHyper system is a model generator and theorem prover for first-order logic with equality. It implements the new E-hyper tableau calculus, which integrates a superposition-based handling of equality into the hyper tableau calculus. E-KRHyper extends our previous KRHyper system, which has been used in a number of applications in the field of knowledge representation. In contrast to most first order theorem provers, it supports features important for such applications, for example queries with predicate extensions as answers, handling of large sets of uniformly structured input facts, arithmetic evaluation and stratified negation as failure. It is our goal to extend the range of application possibilities of KRHyper by adding equality reasoning.