9,679 research outputs found
TEMPOS: A Platform for Developing Temporal Applications on Top of Object DBMS
This paper presents TEMPOS: a set of models and languages supporting the manipulation of temporal data on top of object DBMS. The proposed models exploit object-oriented technology to meet some important, yet traditionally neglected design criteria related to legacy code migration and representation independence. Two complementary ways for accessing temporal data are offered: a query language and a visual browser. The query language, namely TempOQL, is an extension of OQL supporting the manipulation of histories regardless of their representations, through fully composable functional operators. The visual browser offers operators that facilitate several time-related interactive navigation tasks, such as studying a snapshot of a collection of objects at a given instant, or detecting and examining changes within temporal attributes and relationships. TEMPOS models and languages have been formalized both at the syntactical and the semantical level and have been implemented on top of an object DBMS. The suitability of the proposals with regard to applications' requirements has been validated through concrete case studies
Knowledge Representation Concepts for Automated SLA Management
Outsourcing of complex IT infrastructure to IT service providers has
increased substantially during the past years. IT service providers must be
able to fulfil their service-quality commitments based upon predefined Service
Level Agreements (SLAs) with the service customer. They need to manage, execute
and maintain thousands of SLAs for different customers and different types of
services, which needs new levels of flexibility and automation not available
with the current technology. The complexity of contractual logic in SLAs
requires new forms of knowledge representation to automatically draw inferences
and execute contractual agreements. A logic-based approach provides several
advantages including automated rule chaining allowing for compact knowledge
representation as well as flexibility to adapt to rapidly changing business
requirements. We suggest adequate logical formalisms for representation and
enforcement of SLA rules and describe a proof-of-concept implementation. The
article describes selected formalisms of the ContractLog KR and their adequacy
for automated SLA management and presents results of experiments to demonstrate
flexibility and scalability of the approach.Comment: Paschke, A. and Bichler, M.: Knowledge Representation Concepts for
Automated SLA Management, Int. Journal of Decision Support Systems (DSS),
submitted 19th March 200
Reasoning about Independence in Probabilistic Models of Relational Data
We extend the theory of d-separation to cases in which data instances are not
independent and identically distributed. We show that applying the rules of
d-separation directly to the structure of probabilistic models of relational
data inaccurately infers conditional independence. We introduce relational
d-separation, a theory for deriving conditional independence facts from
relational models. We provide a new representation, the abstract ground graph,
that enables a sound, complete, and computationally efficient method for
answering d-separation queries about relational models, and we present
empirical results that demonstrate effectiveness.Comment: 61 pages, substantial revisions to formalisms, theory, and related
wor
Ontology based Scene Creation for the Development of Automated Vehicles
The introduction of automated vehicles without permanent human supervision
demands a functional system description, including functional system boundaries
and a comprehensive safety analysis. These inputs to the technical development
can be identified and analyzed by a scenario-based approach. Furthermore, to
establish an economical test and release process, a large number of scenarios
must be identified to obtain meaningful test results. Experts are doing well to
identify scenarios that are difficult to handle or unlikely to happen. However,
experts are unlikely to identify all scenarios possible based on the knowledge
they have on hand. Expert knowledge modeled for computer aided processing may
help for the purpose of providing a wide range of scenarios. This contribution
reviews ontologies as knowledge-based systems in the field of automated
vehicles, and proposes a generation of traffic scenes in natural language as a
basis for a scenario creation.Comment: Accepted at the 2018 IEEE Intelligent Vehicles Symposium, 8 pages, 10
figure
The ERA of FOLE: Foundation
This paper discusses the representation of ontologies in the first-order
logical environment FOLE (Kent 2013). An ontology defines the primitives with
which to model the knowledge resources for a community of discourse (Gruber
2009). These primitives, consisting of classes, relationships and properties,
are represented by the entity-relationship-attribute ERA data model (Chen
1976). An ontology uses formal axioms to constrain the interpretation of these
primitives. In short, an ontology specifies a logical theory. This paper is the
first in a series of three papers that provide a rigorous mathematical
representation for the ERA data model in particular, and ontologies in general,
within the first-order logical environment FOLE. The first two papers show how
FOLE represents the formalism and semantics of (many-sorted) first-order logic
in a classification form corresponding to ideas discussed in the Information
Flow Framework (IFF). In particular, this first paper provides a foundation
that connects elements of the ERA data model with components of the first-order
logical environment FOLE, and the second paper provides a superstructure that
extends FOLE to the formalisms of first-order logic. The third paper defines an
interpretation of FOLE in terms of the transformational passage, first
described in (Kent 2013), from the classification form of first-order logic to
an equivalent interpretation form, thereby defining the formalism and semantics
of first-order logical/relational database systems (Kent 2011). The FOLE
representation follows a conceptual structures approach, that is completely
compatible with formal concept analysis (Ganter and Wille 1999) and information
flow (Barwise and Seligman 1997)
- …