Results 1 - 10
of
10
Rules with contextually scoped negation
- Proc. 3 rd European Semantic Web Conf. (ESWC2006
, 2006
"... Abstract. Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism. Especially negation as failure, which intuitively adopts a closed world view, is often claimed to be unsuita ..."
Abstract
-
Cited by 33 (14 self)
- Add to MetaCart
(Show Context)
Abstract. Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism. Especially negation as failure, which intuitively adopts a closed world view, is often claimed to be unsuitable for the Web where knowledge is notoriously incomplete. Nonetheless, it was suggested in the ongoing discussions around rules extensions for languages like RDF(S) or OWL to allow at least restricted forms of negation as failure, as long as negation has an explicitly defined, finite scope. Yet clear definitions of such “scoped negation ” as well as formal semantics thereof are missing. We propose logic programs with contexts and scoped negation and discuss two possible semantics with desirable properties. We also argue that this class of logic programs can be viewed as a rule extension to a subset of RDF(S). 1
A realistic architecture for the semantic web
- In RuleML
, 2005
"... Harold.Boley AT nrc-cnrc.gc.ca Abstract. In this paper we argue that a realistic architecture for the Semantic Web must be based on multiple independent, but interoperable, stacks of languages. In particular, we argue that there is a very important class of rule-based languages, with over thirty yea ..."
Abstract
-
Cited by 24 (3 self)
- Add to MetaCart
(Show Context)
Harold.Boley AT nrc-cnrc.gc.ca Abstract. In this paper we argue that a realistic architecture for the Semantic Web must be based on multiple independent, but interoperable, stacks of languages. In particular, we argue that there is a very important class of rule-based languages, with over thirty years of history and experience, which cannot be layered on top of OWL and must be included in the Semantic Web architecture alongside with the stack of OWL-based languages. The class of languages we are after includes rules in the Logic Programming style, which support default negation. We briefly survey the logical foundations of these languages and then discuss an interoperability framework in which such languages can co-exist with OWL and its extensions. 1
Representing Biological Processes in Modular Action Language ALM
- Proceedings of AAAI 2011 Spring Symposium on Common Sense Reasoning
, 2011
"... This paper presents the formalization of a biological process, cell division, in modular action language ALM. We show how the features of ALM—modularity, separation between an uninterpreted theory and its interpretation—lead to a simple and elegant solution that can be used in answering questions fr ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
(Show Context)
This paper presents the formalization of a biological process, cell division, in modular action language ALM. We show how the features of ALM—modularity, separation between an uninterpreted theory and its interpretation—lead to a simple and elegant solution that can be used in answering questions from biology textbooks.
A Unified Semantics for Constraint Handling Rules in Transaction Logic
"... Abstract. Reasoning on Constraint Handling Rules (CHR) programs and their executional behaviour is often ad-hoc and outside of a formal system. This is a pity, because CHR subsumes a wide range of important automated reasoning services. Mapping CHR to Transaction Logic (T R) combines CHR rule specif ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
Abstract. Reasoning on Constraint Handling Rules (CHR) programs and their executional behaviour is often ad-hoc and outside of a formal system. This is a pity, because CHR subsumes a wide range of important automated reasoning services. Mapping CHR to Transaction Logic (T R) combines CHR rule specification, CHR rule application, and reasoning on CHR programs and CHR derivations inside one formal system which is executable. This new T R semantics obviates the need for disjoint declarative and operational semantics. 1
Logic programs with contextually scoped negation
- In 20th Workshop on Logic Programming (WLP
, 2006
"... Abstract. The Semantic Web community is currently dominated by knowledge representation formalisms adhering to a strict open world assumption. Nonmonotonic reasoning formalisms are viewed with partial scepticism and it is often argued that nonmonotonic reasoning techniques which adopt a closed world ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
(Show Context)
Abstract. The Semantic Web community is currently dominated by knowledge representation formalisms adhering to a strict open world assumption. Nonmonotonic reasoning formalisms are viewed with partial scepticism and it is often argued that nonmonotonic reasoning techniques which adopt a closed world assumption are invalid in an open environment such as the Web where knowledge is notoriously incomplete. Nonetheless, in the ongoing discussion about rule extensions for Semantic Web Languages like RDF(S) or OWL several proposals have been made to partly break with this view and to allow a restricted form of negation as failure. Recently, the term “scoped negation ” emerged in discussions around this topic, yet a clear definition about the meaning of “scope ” and “scoped negation ” and a formal semantics are still missing. In this paper we provide preliminary results towards these missing definitions and define two possible semantics for logic programs with contextually scoped negation, which we propose as an extension of RDFS. 1
Empowering OWL with overriding inheritance, conflict resolution and non-monotonic reasoning
- In AAAI Spring Symposium on Social Semantic Web: Where Web 2.0 meets Web 3.0 (2009) 62
, 2011
"... The popularity of OWL for knowledge representation in the Semantic Web applications makes it an attrac-tive platform. Although OWL supports some form of object-oriented features for knowledge structuring and maintenance, it is significantly weak in capturing most essential object-oriented features s ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
The popularity of OWL for knowledge representation in the Semantic Web applications makes it an attrac-tive platform. Although OWL supports some form of object-oriented features for knowledge structuring and maintenance, it is significantly weak in capturing most essential object-oriented features such as single and multiple inheritance, default class values, meth-ods, overriding and encapsulation in their true spirits. It is also weak in extending reasoning support for in-telligent knowledge processing. Such features are be-coming increasingly essential in applications such as social networks, e-commerce and knowledge rich on-tology for Life Sciences. In this paper, we propose an extension of OWL toward a more powerful knowl-edge structuring language, called OWL++, by support-ing multiple different types of inheritance with overrid-ing, and non-monotonic reasoning capabilities within OWL. We demonstrate OWL++’s computability and implementability by presenting a translational seman-tics of OWL++ to OWL, for which we have robust ex-ecution engines while for the reasoning component of OWL++ we rely on Jena to support rules in OWL.
Technical Communications of ICLP
, 2015
"... Abstract In this paper, we introduce our work on our doctorate with title "Higher Order Support in Logic Specification Languages for Data Mining Applications". Current logic specification languages, such as FO(·) provide an intuitive way for defining the knowledge within a problem domain. ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract In this paper, we introduce our work on our doctorate with title "Higher Order Support in Logic Specification Languages for Data Mining Applications". Current logic specification languages, such as FO(·) provide an intuitive way for defining the knowledge within a problem domain. Extended support for data representation is lacking however, and we want to introduce structured recursive types and generic types, together with a first class citizen approach to predicates. These additions correspond to higher order concepts. We provide a background of the current techniques that might be of interest when implementing these higher order abstractions, such as lazy grounding and oracles. We sketch the eventual goal of our research, and give an overview of the current state and research questions that are being considered.
Logical Formalizations of Commonsense Reasoning — Papers from the AAAI 2011 Spring Symposium (SS-11-06) Representing Biological Processes in Modular Action Language ALM
"... This paper presents the formalization of a biological process, cell division, in modular action language ALM. Weshow how the features of ALM—modularity, separation between an uninterpreted theory and its interpretation—lead to a simple and elegant solution that can be used in answering questions fro ..."
Abstract
- Add to MetaCart
(Show Context)
This paper presents the formalization of a biological process, cell division, in modular action language ALM. Weshow how the features of ALM—modularity, separation between an uninterpreted theory and its interpretation—lead to a simple and elegant solution that can be used in answering questions from biology textbooks.
Implementation of an F-Logic Kernel in CHR
"... Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language, rewriting constraints in relational syntax. Frame-Logic is an extension of classical predicate logic which accounts in a declarative way for many features of object-orientation. This exploratory paper g ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language, rewriting constraints in relational syntax. Frame-Logic is an extension of classical predicate logic which accounts in a declarative way for many features of object-orientation. This exploratory paper gives a concise CHR implementation of Frame-Logic’s core features, including object-oriented constraint syntax, type-checking, and interaction of Frame-Logic deduction with non-monotonic overriding by inheritance. 1
IOS Press Forest Logging: A Trace-Based Analysis of
"... Abstract. Knowledge representation systems based on the well-founded semantics can offer the degree of scalability required for semantic web applications and make use of ex-pressive semantic features such as Hilog, frame-based rea-soning, and defeasibility theories. Such features can be com-piled in ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. Knowledge representation systems based on the well-founded semantics can offer the degree of scalability required for semantic web applications and make use of ex-pressive semantic features such as Hilog, frame-based rea-soning, and defeasibility theories. Such features can be com-piled into Prolog tabling engines that have good support for indexing and memory management. However, due both to the power of the semantic features and to the declarative style typical of knowledge representation rules, the resources needed for query evaluation can be unpredictable. In such a situation, users need to understand the overall structure of a computation and examine problematic portions of it. This problem, of profiling a computation, differs from debug-ging and justification which address why a given answer was or wasn’t derived, and so profiling requires different tech-niques. In this paper we present a trace-based analysis tech-nique called forest logging which has been used to profile large, heavily tabled computations. In forest logging, criti-cal aspects of a tabled computation are logged; afterwards the log is loaded and analyzed. As implemented in XSB, for-est logging slows down execution of practical programs by a constant factor that is often small; and logs containing tens or hundreds of millions of facts can be loaded and analyzed in minutes.
