RULEML
14 years 3 months ago
2004 Springer
Abstract. Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology i...
RULEML
14 years 3 months ago
2004 Springer
We propose to extend description logic with defeasible rules, and to use the inferential mechanism of defeasible logic to reason with description logic constructors.
RULEML
14 years 3 months ago
2004 Springer
RuleML and SWRL are closely related rule markup languages that are growing in popularity particularly within the Semantic Web community. Both are based on XML and as such are more ...
RULEML
14 years 3 months ago
2004 Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
RULEML
14 years 3 months ago
2004 Springer
Abstract. This paper describes the design and implementation of SweetProlog, a system for translating Web rules into Prolog. It enables the integration of ontologies and rules on t...
|