Results 1  10
of
738,188
Formal Ontology and Information Systems
, 1998
"... Research on ontology is becoming increasingly widespread in the computer science community, and its importance is being recognized in a multiplicity of research fields and application areas, including knowledge engineering, database design and integration, information retrieval and extraction. We sh ..."
Abstract

Cited by 878 (11 self)
 Add to MetaCart
Research on ontology is becoming increasingly widespread in the computer science community, and its importance is being recognized in a multiplicity of research fields and application areas, including knowledge engineering, database design and integration, information retrieval and extraction. We shall use the generic term information systems, in its broadest sense, to collectively refer to these application perspectives. We argue in this paper that socalled ontologies present their own methodological and architectural peculiarities: on the methodological side, their main peculiarity is the adoption of a highly interdisciplinary approach, while on the architectural side the most interesting aspect is the centrality of the role they can play in an information system, leading to the perspective of ontologydriven information systems.
Guarded Commands, Nondeterminacy and Formal Derivation of Programs
, 1975
"... Socalled "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniqilely determined by the initial state. ..."
Abstract

Cited by 521 (0 self)
 Add to MetaCart
. For the formal derivation of programs expressed in terms of these constructs, a calculus will be be shown.
Applications Of Circumscription To Formalizing Common Sense Knowledge
 Artificial Intelligence
, 1986
"... We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects o ..."
Abstract

Cited by 536 (12 self)
 Add to MetaCart
We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects
Statecharts: A Visual Formalism For Complex Systems
, 1987
"... We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discreteevent systems, such as multicomputer realtime systems, communication protocols and digital control units. Our diagrams, which we cal ..."
Abstract

Cited by 2683 (56 self)
 Add to MetaCart
We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discreteevent systems, such as multicomputer realtime systems, communication protocols and digital control units. Our diagrams, which we
2013. “Formal Statement of the Special Principle of Relativity
 How Things Persist
, 2001
"... While there is a longstanding discussion about the interpretation of the extended, general principle of relativity, there seems to be a consensus that the special principle of relativity is absolutely clear and unproblematic. However, a closer look at the literature on relativistic physics reveals ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
of the principle. In view of the fact that the special relativity principle is considered as a universal metalaw, which must be valid for all physical laws in all situations, we try to keep the formalism as general as possible. The benefit of the formal reconstruction is that it makes explicit all the necessary
Appendix Formal Statement of Results and Detailed Proofs
"... Proposition 1. If a symmetric Nash equilibrium (SNE) exists, advertising levels and prices are given by the following system of equations: a / 0 p Xn 1 n F ð^xÞ ða Þ 1 F ð^xÞ n k 1 F ð^xÞ n k () Š 0; ð1Þ n k k0 1 F ðp =lÞ n nðp =lÞ f ð^xÞ 1 F ð^xÞ n n 1 F ð^xÞ þ ..."
Abstract
 Add to MetaCart
Proposition 1. If a symmetric Nash equilibrium (SNE) exists, advertising levels and prices are given by the following system of equations: a / 0 p Xn 1 n F ð^xÞ ða Þ 1 F ð^xÞ n k 1 F ð^xÞ n k () Š 0; ð1Þ n k k0 1 F ðp =lÞ n nðp =lÞ f ð^xÞ 1 F ð^xÞ n n 1 F ð^xÞ þ
Notes On Formalizing Context
, 1993
"... These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit axiomatizat ..."
Abstract

Cited by 420 (9 self)
 Add to MetaCart
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit
From SHIQ and RDF to OWL: The Making of a Web Ontology Language
 Journal of Web Semantics
, 2003
"... The OWL Web Ontology Language is a new formal language for representing ontologies in the Semantic Web. OWL has features from several families of representation languages, including primarily Description Logics and frames. OWL also shares many characteristics with RDF, the W3C base of the Semantic W ..."
Abstract

Cited by 621 (44 self)
 Add to MetaCart
The OWL Web Ontology Language is a new formal language for representing ontologies in the Semantic Web. OWL has features from several families of representation languages, including primarily Description Logics and frames. OWL also shares many characteristics with RDF, the W3C base of the Semantic
Differential privacy . . .
, 2009
"... We show by means of several examples that robust statistical estimators present an excellent starting point for differentially private estimators. Our algorithms use a new paradigm for differentially private mechanisms, which we call ProposeTestRelease (PTR), and for which we give a formal definit ..."
Abstract

Cited by 629 (10 self)
 Add to MetaCart
We show by means of several examples that robust statistical estimators present an excellent starting point for differentially private estimators. Our algorithms use a new paradigm for differentially private mechanisms, which we call ProposeTestRelease (PTR), and for which we give a formal
Results 1  10
of
738,188