Entailment Semantics for Rules with Priorities
File version
Version of Record (VoR)
Author(s)
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Veloso, MM
Date
Size
File type(s)
Location
Hyderabad, INDIA
License
Abstract
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]. Defa lt 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.
Journal Title
Conference Title
20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
DOI
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© 2007 International Joint Conference on Artificial Intelligence. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the Conference's website for access to the definitive, published version.