Nonmonotonic Rule Systems on Top of Ontology Layers
Lecture notes in computer sciencePublished 1 January 2002
Grigoris Antoniou
Citations56
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper outlines how nonmonotonic rule systems in the form of defeasible reasoning, can be built on top of description logics.
Abstract
The development of the Semantic Web proceeds in layers. Currently the most advanced layer that has reached maturity is the ontology layer, in the from of the DAML+OIL language which corresponds to a rich description logic. The next step will be the the realization of logical rule systems on top of the ontology layer. Computationally simple nonmonotonic rule systems show promise to play an important role in electronic commerce on the Semantic Web. In this paper we outline how nonmonotonic rule systems in the form of defeasible reasoning, can be built on top of description logics.
Keywords
Computer Science
Artificial IntelligenceA logic for default reasoning
3,920 Citations1980Raymond Reiter
This paper proposes a logic for default reasoning, develops a complete proof theory and shows how to interface it with a top down resolution theorem prover, and provides criteria under which the revision of derived beliefs must be effected.
ACM Transactions on Computational LogicRepresentation results for defeasible logic
370 Citations2001Grigoris Antoniou, David P. Billington +2 more
The transformations described in this paper have two main benefits: on one hand they can be used as a theoretical tool that leads to a deeper understanding of the formalism, and on the other hand they have been used in the development of an efficient implementation of defeasible logic.
Artificial IntelligenceCombining Horn rules and description logics in CARIN
363 Citations1998Alon Y. Levy, Marie-Christine Rousset
It is shown that in general, the reasoning problem for recursive carin - A LCNR knowledge bases is undecidable, and the constructors of ALCNR causing the undecidability is identified.
Ontology reasoning in the SHOQ(D) description logic
313 Citations2001Ian Horrocks, Ulrike Sattler
SHOQ(D) is an expressive description logic equipped with named individuals and concrete datatypes which has almost exactly the same expressive power as the latest web ontology languages (e.g., OIL and DAML).
Reasoning in description logics
306 Citations1997Francesco M. Donini, Maurizio Lenzerini +2 more
Techniques for reasoning and computational complex problems in Description Logics are surveyed, including reasoning with plain concept expressions, reasoning with instances of concepts, and reasoning with axioms.
Defeasible logic
272 Citations1994Donald Nute
SciDok (Saarland University and State Library)Decidable reasoning in terminological knowledge representation systems
190 Citations1993Martin Buchheit, Francesco M. Donini +1 more
The decidability of a number of desirable TKRS-deduction services are proved through a sound, complete and terminating calculus for reasoning in ALCNR-knowledge bases, and the result that inclusion statements in A LCNR can be simulated by terminological cycles, if descriptive semantics is adopted.
Logical Tools for Modelling Legal Argument : A Study of Defeasible Reasoning in Law
169 Citations2012Henry Prakken
The study shows that legal reasoning features do not escape a logical analysis if recent developments in logic and Artificial Intelligence on so-called non-monotonic reasoning and defeasible argumentation are used, and if logic is regarded as a tool in, rather than as, a model of legal argument.
Defeasible Logic
161 Citations1994Donald Nute
Theory and Practice of Logic ProgrammingPropositional defeasible logic has linear complexity
157 Citations2001Michael J. Maher
CARIN: A Representation Language Combining Horn Rules and Description Logics.
143 Citations1996Alon Y. Levy, Marie-Christine Rousset
An existential entailment algorithm for CARIN languages whose description logic component is ALCNR is described, which entails several important results for reasoning in CARIN, most notably: a sound and complete inference procedure for non recursive CARIN-ALCNR, and an algorithm for determining rule subsumption over ALCNR.
Lecture notes in computer scienceA terminological knowledge representation system with complete inference algorithms
140 Citations1991Franz Baader, Bernhard Hollunder
The formal model-theoretic semantics which has been introduced for kl-one languages [BL84] provides means for investigating soundness and completeness of inference algorithms.
Journal of Artificial Intelligence ResearchDecidable Reasoning in Terminological Knowledge Representation Systems
109 Citations1993Martin Buchheit, Francesco M. Donini +1 more
A declarative approach to business rules in contracts
102 Citations1999Benjamin N. Grosof, Yannis Labrou +1 more
This work gives a new fundamental knowledge representation formalism: a generalized version of Courteous Logic Programs (CLP), which expressively extends declarative ordinary logic programs (OLP) to include prioritized conflict handling, thus enabling modularity in specifying and revising rule-sets.
SSRN Electronic JournalA Declarative Approach to Business Rules in Contracts: Courteous Logic Programs in XML
54 Citations2001Benjamin N. Grosof, Yannis Labrou +1 more
Lecture notes in computer scienceA hybrid system with datalog and concept languages
42 Citations1991Francesco M. Donini, Maurizio Lenzerini +2 more
A method for hybrid reasoning based on constrained resolution is proposed, where the usual deduction procedure defined for Datalog is integrated with a method for reasoning on the structural knowledge.
Defeasible Logic for Automated Negotiation
24 Citations2000Guido Governatori, Arthur H. M. ter Hofstede +1 more
This paper investigates the application of defeasible logic for automated negotiation in the context of e-commerce and finds it flexible enough to be adapted to several possible negotiation strategies, has efficient implementations and provides a formal basis for analysis.