1993
DOI: 10.1093/logcom/3.4.379
|View full text |Cite
|
Sign up to set email alerts
|

Defeasible Logic is Stable

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
64
0
1

Year Published

2000
2000
2009
2009

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 81 publications
(65 citation statements)
references
References 0 publications
0
64
0
1
Order By: Relevance
“…9 Derivability for knowledge (±∆ K , ±∂ K ) has the same conditions as those given for derivability in Section 5. It is true that the complete and accurate definition of the inference conditions is cumbersome but the intuition is natural and easy to understand.…”
Section: The Systemmentioning
confidence: 99%
See 1 more Smart Citation
“…9 Derivability for knowledge (±∆ K , ±∂ K ) has the same conditions as those given for derivability in Section 5. It is true that the complete and accurate definition of the inference conditions is cumbersome but the intuition is natural and easy to understand.…”
Section: The Systemmentioning
confidence: 99%
“…Defeasible logic, as developed by Nute [51,50] with a particular concern about computational efficiency and developed over the years by [9,5,4] is our choice. The reason being ease of implementation [46], flexibility [4] (it has a constructively defined and easy to use proof theory), modularity [5] and it is efficient: it is possible to compute the complete set of consequences of a given theory in linear time [44].…”
Section: Overview Of Defeasible Logicmentioning
confidence: 99%
“…However, we hope to give enough information to make the discussion intelligible. We refer the reader to [24,10,4] for more thorough treatments. As usual with non-monotonic reasoning, we have to specify 1) how to represent a knowledge base and 2) the inference mechanism.…”
Section: Defeasible Logicmentioning
confidence: 99%
“…For this reason an attempt has been made, by using a language which has proven successful in the field of ontologies and combining its principles with properties of a more flexible logic, to solve in part the motivating problem driving this work. The proposed method for solving this is to integrate two established forms of logic, Description logic [8] and Defeasible logic [4,10,24]. Description logics though imparting strong and conclusive reasoning mechanisms, lack the flexibility of Defeasible logics non-monotonic reasoning mechanisms, which add flexibility to knowledge bases that have partial knowledge.…”
Section: Introductionmentioning
confidence: 99%
“…A defeasible logic was first published by Nute [9]. Since then, some systems of the same kind of defeasible logics have been developed [1,2,10]. We introduce Billington's defeasible logic in [2], The defeasible logic has facts and three kinds of rules, a strict rule (A → q), a defeasible rule (A ⇒ q) and a defeater (A q), and a superiority relation > between those rules to carry out defeasible reasoning.…”
Section: R2mentioning
confidence: 99%