Entailment Semantics for Rules with Priorities
نویسنده
چکیده
We define a new general rule-based nonmonotonic framework which allows an external acyclic priority relation between rules to be interpreted in several ways. Several entailment semantics are defined via a constructive digraph, with one being given a declarative fixed-point characterisation as well. Each of these semantics satisfies Principle 1 of [Brewka and Eiter 1999]. The framework encompasses Default Logic [Reiter 1980], ground Answer Set Programming (ASP) [Baral 2003], and Defeasible Logic [Nute 1994]. Default Logic is provided with a new semantics which is ambiguity blocking, rather than the usual ambiguity propagating semantics. Also Reiterextensions are given a new fixed-point characterisation; and Lukaszewicz’s [1990] m-extensions are given a much simpler construction and fixed-point characterisation.
منابع مشابه
Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailment. We start from an abstract syntax that views a rule as a pair of rule graphs which generalize RDF graphs by also allowing rule variables in subject, predicate and object positions. We include RDFS as well as a decidable part of OWL that weakens D-entailment and OWL F...
متن کاملDeclarative Semantics in Object-Oriented Software Development - A Taxonomy and Survey
One of the modern paradigms to develop an application is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles in applications. In an application, we must distinguish between procedural semantics and declarative semantics for their implementation in a specific programming language. For the procedural semantics, we can write a ...
متن کاملA Tableau Calculus for Equilibrium Entailment
We apply tableau methods to the problem of computing entailment in the nonmonotonic system of equilibrium logic, a generalisation of the inference relation associated with the stable model and answer set semantics for logic programs. We describe tableau calculi for the nonclassical logics underyling equilibrium entailment, namely hereand-there with strong negation and its strengthening classica...
متن کاملCompleteness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary
We prove that entailment for RDFS (RDF Schema) is decidable, NP-complete, and in P if the target graph does not contain blank nodes. We show that the standard set of entailment rules for RDFS is incomplete and that this can be corrected by allowing blank nodes in predicate position. We define semantic extensions of RDFS that involve datatypes and a subset of the OWL vocabulary that includes the...
متن کاملA Reasoning Algorithm for pD*
pD* semantics extends the ‘if-semantics’ of RDFS to a subset of the OWL vocabulary. It leads to simple entailment rules and relatively low computational complexity for reasoning. In this paper, we propose a forward-chaining reasoning algorithm to support RDFS entailments under the pD* semantics. This algorithm extends the Sesame algorithm to cope with the pD* entailments. In particular, an opti...
متن کامل