Results 1 - 10 of 124

Description Logic Programs: Combining Logic Programs with Description Logic

by Benjamin N. Grosof, Ian Horrocks , 2002
"... We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) ..."
Abstract - Cited by 529 (46 self) - Add to MetaCart
We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) contained within this intersection: Description Logic Programs (DLP), and the closely related Description Horn Logic (DHL) which is an expressive fragment of first-order logic (FOL). DLP provides a significant degree of expressiveness, substantially greater than the RDFSchema fragment of Description Logic.

REPRESENTING BUSINESS CONTRACTS IN RuleML

by Guido Governatori , 2005
"... This paper presents an approach for the specification and implementation of translating contracts from a human-oriented form into an executable representation for monitoring. This will be done in the setting of RuleML. The task of monitoring contract execution and performance requires a logical acco ..."
Abstract - Cited by 103 (49 self) - Add to MetaCart
This paper presents an approach for the specification and implementation of translating contracts from a human-oriented form into an executable representation for monitoring. This will be done in the setting of RuleML. The task of monitoring contract execution and performance requires a logical account of deontic and defeasible aspects of legal language; currently such aspects are not covered by RuleML; accordingly we show how to extend it to cover such notions. From its logical form, the contract will be thus transformed into a machine readable rule notation and eventually implemented as executable semantics via any mark-up languages depending on the client’s preference, for contract monitoring purposes.

No Registration Needed: How to Use Declarative Policies and Negotiation to Access Sensitive Resources on the Semantic Web

by Rita Gavriloaie, Wolfgang Nejdl, Daniel Olmedilla, Kent E. Seamons, Marianne Winslett - In 1st European Semantic Web Symposium (ESWS 2004), volume 3053 of Lecture Notes in Computer Science , 2004
"... Gaining access to sensitive resources on the Web usually involves an explicit registration step, where the client has to provide a predetermined set of information to the server. The registration process yields a login/password combination, a cookie, or something similar that can be used to access t ..."
Abstract - Cited by 85 (41 self) - Add to MetaCart
Gaining access to sensitive resources on the Web usually involves an explicit registration step, where the client has to provide a predetermined set of information to the server. The registration process yields a login/password combination, a cookie, or something similar that can be used to access the sensitive resources. In this paper we show how an explicit registration step can be avoided on the Semantic Web by using appropriate semantic annotations, rule-oriented access control policies, and automated trust negotiation. After presenting the PeerTrust language for policies and trust negotiation, we describe our implementation of implicit registration and authentication that runs under the Java-based MINERVA Prolog engine. The implementation includes a PeerTrust policy applet and evaluator, facilities to import local metadata, policies and credentials, and secure communication channels between all parties.
(Show Context)

A Conceptual Architecture for Semantic Web Services

by Chris Preist, Chris Preist - In Proceedings of the International Semantic Web Conference 2004 (ISWC 2004 , 2004
"... semantic web, web services, architecture, agents This paper is an extended version of one presented at the International Semantic Web Conference, 2004. In it, we present an abstract conceptual architecture for semantic web services. We define requirements on the architecture by analyzing a set of ca ..."
Abstract - Cited by 65 (3 self) - Add to MetaCart
semantic web, web services, architecture, agents This paper is an extended version of one presented at the International Semantic Web Conference, 2004. In it, we present an abstract conceptual architecture for semantic web services. We define requirements on the architecture by analyzing a set of case studies developed as part of the EU Semantic Web-enabled Web Services project. The architecture is developed as a refinement and extension of the W3C Web Services Architecture. We assess our architecture against the requirements, and provide an analysis of OWL-S.
(Show Context)

A defeasible logic reasoner for the semantic web

by Nick Bassiliades, Grigoris Antoniou, Ioannis Vlahavas - In Proc. of the Workshop on Rules and Rule Markup Languages for the Semantic Web , 2004
"... Abstract. Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arises naturally; and for the modeling of business rules and policies, where r ..."
Abstract - Cited by 50 (11 self) - Add to MetaCart
Abstract. Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arises naturally; and for the modeling of business rules and policies, where rules with exceptions are often used. This paper describes these scenarios in more detail, and reports on the implementation of a system for defeasible reasoning on the Web. The system is called DR-DEVICE and is capable of reasoning about RDF metadata over multiple Web sources using defeasible logic rules. The system is implemented on top of CLIPS production rule system and builds upon R-DEVICE, an earlier deductive rule system over RDF metadata that also supports derived attribute and aggregate attribute rules. Rules can be expressed either in a native CLIPS-like language, or in an extension of the OO-RuleML syntax. The operational semantics of defeasible logic are implemented through compilation into the generic rule language of R-DEVICE. The paper also briefly presents a semantic web broker example for apartment renting. 1.
(Show Context)

PeerTrust: Automated Trust Negotiation for Peers on the Semantic Web

by Wolfgang Nejdl, Daniel Olmedilla, Marianne Winslett - In Workshop on Secure Data Management in a Connected World (SDM’04 , 2004
"... Researchers have recently begun to develop and investigate policy languages to describe trust and security requirements on the Semantic Web. Such policies will be one component of a run-time system that can negotiate to establish trust on the Semantic Web. In this paper, we show how to express diffe ..."
Abstract - Cited by 46 (8 self) - Add to MetaCart
Researchers have recently begun to develop and investigate policy languages to describe trust and security requirements on the Semantic Web. Such policies will be one component of a run-time system that can negotiate to establish trust on the Semantic Web. In this paper, we show how to express different kinds of access control policies and control their use at run time using PeerTrust, a new approach to trust establishment. We show how to use distributed logic programs as the basis for PeerTrust’s simple yet expressive policy and trust negotiation language, built upon the rule layer of the Semantic Web layer cake. We describe the PeerTrust language based upon distributed logic programs, and compare it to other approaches to implementing policies and trust negotiation. Through examples, we show how PeerTrust can be used to support delegation, policy protection and negotiation strategies in the ELENA distributed eLearning environment. Finally, we discuss related work and identify areas for further research.
(Show Context)

Sweetjess: Translating DAMLRuleML to JESS

by Benjamin N. Grosof, Mahesh D. Gandhe, Timothy W. Finin, Benjamin N. Grosof, Mahesh D. G, Timothy W. Finin - In: Proc. International Workshop on Rule Markup Languages for Business Rules on the Semantic Web , 2002
"... For more information, please visit our website at ..."
Abstract - Cited by 34 (10 self) - Add to MetaCart
For more information, please visit our website at

CTR-S: A Logic for Specifying Contracts in Semantic Web Services

by Hasan Davulcu, Michael Kifer, I. V. Ramakrishnan - WWW2004 , 2004
"... A requirements analysis in the emerging field of Semantic Web Services (SWS) (see ..."
Abstract - Cited by 32 (5 self) - Add to MetaCart
A requirements analysis in the emerging field of Semantic Web Services (SWS) (see

Preference-based selection of highly configurable web services

by Steffen Lamparter, Anupriya Ankolekar, Rudi Studer - In WWW ’07: Proceedings of the 16th international conference on World Wide Web , 2007
"... A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configurations. Current approaches, such as WS-Agreement, describe Web services by enumerating the various possible service config ..."
Abstract - Cited by 32 (2 self) - Add to MetaCart
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configurations. Current approaches, such as WS-Agreement, describe Web services by enumerating the various possible service configurations, an inefficient approach when dealing with numerous service attributes with large value spaces. We model Web service configurations and associated prices and preferences more compactly using utility function policies, which also allows us to draw from multi-attribute decision theory methods to develop an algorithm for optimal service selection. In this paper, we present an OWL ontology for the specification of configurable Web service offers and requests, and a flexible and extensible framework for optimal service selection that combines declarative logic-based matching rules with optimization methods, such as linear programming. Assuming additive price/preference functions, experimental results indicate that our algorithm introduces an overhead of only around 2 sec. compared to random service selection, while giving optimal results. The overhead, as percentage of total time, decreases as the number of offers and configurations increase.
(Show Context)

How Similar Is It? Towards Personalized Similarity Measures in Ontologies

by Abraham Bernstein, Esther Kaufmann, Christoph Bürki, Mark Klein - In 7. Internationale Tagung Wirtschaftsinformatik , 2005
"... Abstract: Finding a good similarity assessment algorithm for the use in ontologies is central to the functioning of techniques such as retrieval, matchmaking, clustering, data-mining, ontology translations, automatic database schema matching, and simple object comparisons. This paper assembles a cat ..."
Abstract - Cited by 32 (2 self) - Add to MetaCart
Abstract: Finding a good similarity assessment algorithm for the use in ontologies is central to the functioning of techniques such as retrieval, matchmaking, clustering, data-mining, ontology translations, automatic database schema matching, and simple object comparisons. This paper assembles a catalogue of ontology based similarity measures, which are experimentally compared with a “similarity gold standard ” obtained by surveying 50 human subjects. Results show that human and algorithmic similarity predications varied substantially, but could be grouped into cohesive clusters. Addressing this variance we present a personalized similarity assessment procedure, which uses a machine learning component to predict a subject’s cluster membership, providing an excellent prediction of the gold standard. We conclude by hypothesizing ontology dependent similarity measures.