On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Handbook of theoretical computer science (vol. B)
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
From SPARQL to rules (and back)
Proceedings of the 16th international conference on World Wide Web
Proceedings of the 17th international conference on World Wide Web
N3logic: A logical framework for the world wide web
Theory and Practice of Logic Programming
Using Dependency Tracking to Provide Explanations for Policy Management
POLICY '08 Proceedings of the 2008 IEEE Workshop on Policies for Distributed Systems and Networks
Rule Interchange Format: The Framework
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
OpenRuleBench: an analysis of the performance of rule engines
Proceedings of the 18th international conference on World wide web
SILK: Higher Level Rules with Defaults and Semantic Scalability
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Proof explanation in the DR-DEVICE system
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Rules with contextually scoped negation
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Linked rules: principles for rule reuse on the web
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Cloud-Centric assured information sharing
PAISI'12 Proceedings of the 2012 Pacific Asia conference on Intelligence and Security Informatics
Hi-index | 0.00 |
The Accountability In RDF (AIR) language is an N3-based, Semantic Web production rule language that supports nested activation of rules, negation, closed world reasoning, scoped contextualized reasoning, and explanation of inferred facts. Each AIR rule has unique identifier (typically an HTTP URI) that supports reuse of rule. In this paper we analyze the semantics of AIR language by: i) giving the declarative semantics that support the reasoning algorithm, ii) providing complexity of AIR inference; and iii) evaluating the expressiveness of language by encoding Logic Programs of different expressivities in AIR.