Defeasible Description Logics
Lecture notes in computer sciencePublished 1 January 2004
Guido Governatori
Citations31
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 work proposes to extend description logic with defeasible rules, and to use the inferential mechanism of defeasibility logic to reason with description logic constructors.
Abstract
We propose to extend description logic with defeasible rules, and to use the inferential mechanism of defeasible logic to reason with description logic constructors.
Keywords
Computer Science
SSRN Electronic JournalDescription Logic Programs: Combining Logic Programs with Description Logic
810 Citations2003Benjamin N. Grosof, Ian Horrocks +2 more
Cambridge University Press eBooksBasic Description Logics
566 Citations2007Franz Baader, Werner Nutt
This chapter provides an introduction to Description Logics as a formal language for representing knowledge and reasoning about it, covering syntax and semantics, and the basic constructors that are used in systems or have been introduced in the literature.
Handbook of Logic in Artificial Intelligence and Logic Programming
385 Citations1993
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.
Description logic programs
347 Citations2003Benjamin N. Grosof, Ian Horrocks +2 more
It is shown how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules and ontologies and define a new intermediate knowledge representation contained within this intersection: Description Logic Programs (DLP), and the closely related Description Horn Logic (DHL).
SciDok (Saarland University and State Library)Embedding defaults into terminological knowledge representation formalisms
263 Citations1993Franz Baader, Bernhard Hollunder
Combining answer set programming with description logics for the semantic web
253 Citations2004Thomas Eiter, Thomas Lukasiewicz +2 more
Journal of Automated ReasoningEmbedding defaults into terminological knowledge representation formalisms
186 Citations1995Franz Baader, Bernhard Hollunder
An algorithm for computing extensions is described and it is shown how the inference procedures of terminological systems can be modified to give optimal support to this algorithm.
Theory and Practice of Logic ProgrammingPropositional defeasible logic has linear complexity
157 Citations2001Michael J. Maher
A Declarative Approach to Business Rules in Contracts: Courteous Logic Programs in XML
156 Citations2011Benjamin N. Grosof, Yannis Labrou +1 more
Prolog Programming in Depth
131 Citations1988Michael A. Covington, Donald Nute +1 more
Prolog as its own Metalanguage, Artificial Intelligence and the Search for Solutions, and Natural Language Processing.
Journal of Logic and ComputationDefeasible Logic is Stable
121 Citations1993David P. Billington
This work defines, and gives some of the intuition behind the definition of, a nonmonotonic logic called defeasible logic, and shows how well the definition captures the authors' intuitions.
International Journal of Artificial Intelligence ToolsEFFICIENT DEFEASIBLE REASONING SYSTEMS
120 Citations2001Michael J. Maher, Andrew Rock +3 more
Journal of Automated ReasoningPriorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
120 Citations1995Franz Baader, Bernhard Hollunder
The present paper addresses the problem of modifying terminological default logic such that more specific defaults are preferred and obtains an automated default reasoning procedure that takes specificity into account.
arXiv (Cornell University)A flexible framework for defeasible logics
109 Citations2000Grigoris Antoniou, David P. Billington +2 more
Lecture notes in computer scienceAI 2003: Advances in Artificial Intelligence
106 Citations2003Pan, Heping, Tilakaratne, Chandima +1 more
Defeasible logic
98 Citations2001Donald Nute
Default inheritance reasoning in hybrid KL-ONE-style logics
87 Citations1993Umberto Straccia
This paper considers the problem of endowing hybrid KL-ONE-style logics with capabilities for default inheritance reasoning, a kind of default reasoning that is specifically oriented to reasoning on taxonomies.
Lecture notes in computer scienceDefeasible Logic: Agency, Intention and Obligation
82 Citations2004Guido Governatori, Antonino Rotolo
A computationally oriented non-monotonic multi-modal logic arising from the combination of agency, intention and obligation is proposed and shown how to represent and reason with them in the setting of defeasible logic.
A formal approach to protocols and strategies for (legal) negotiation
65 Citations2001Guido Governatori, Marlon Dumas +2 more
This work proposes a formal and executable framework for expressing protocols and strategies for automated (legal) negotiation through a software agent composed of four modules: a communication module, a control module, reasoning module specified as a defeasible theory, and a knowledge base.
Lecture notes in computer scienceNonmonotonic Rule Systems on Top of Ontology Layers
56 Citations2002Grigoris Antoniou
This paper outlines how nonmonotonic rule systems in the form of defeasible reasoning, can be built on top of description logics.
Electronic Commerce Research and ApplicationsA formal approach to negotiating agents development
46 Citations2002Marlon Dumas, Guido Governatori +2 more
This paper presents a formal and executable approach to capture the behaviour of parties involved in a negotiation that is justified against a set of desirable criteria, and their suitability is illustrated through concrete examples of bidding and multi-lateral bargaining scenarios.
Toward a Declarative Language for Negotiating Executable Contracts
46 Citations2003Daniel M. Reeves, Benjamin N. Grosof +1 more
The goal is to develop a shared language with which agents can define the scope and content of a negotiation, and reach a common understanding of the negotiation rules and the contract implications of negotiation actions, including via automated auctions.
On the Modeling and Analysis of Regulations
45 Citations1999Grigoris Antoniou, David P. Billington +2 more
The support that can be provided by logic modelling is highlighted, the technical foundation of the project is described, and the status and next steps are reported on.
Lecture notes in computer scienceA Defeasible Ontology Language
39 Citations2002Stijn Heymans, Dirk Vermeir
The description logic SHOQ(D) is extended with a preference order on the axioms, and it is argued that such a defeasible language may be usefully applied for learning and integrating ontologies.
Lecture notes in computer scienceCombining Description Logic and Defeasible Logic for the Semantic Web
39 Citations2004Kewen Wang, David P. Billington +2 more
This paper proposes a novel approach to combining Defeasible Logic with Description Logics by introducing the Description Defeasibility Logic (DDL), and gives some basic properties of DDL, one of which shows that DDL is a tractable language provided that the underlying Description Logic is tractable.
A terminological logic with defaults: a definition and an application
32 Citations1993Lin Padgham, Tingting Zhang
A terminological language which includes defaults, and a definition of default subsumption based on the notion of skeptical in heritance in default reasoning is presented, and an evaluation of the diagnosis application is presented on the basis of comparison with 63 pa tient protocols.
Lecture notes in computer scienceRules and Defeasible Reasoning on the Semantic Web
30 Citations2003Grigoris Antoniou, Gerd Wagner
It is argued that rule formalisms and rule-based technologies have to offer a lot for the Semantic Web, in particular, they allow a simple treatment of defeasible reasoning, which is essential for being able to capture many forms of commonsense policies and specifications.
A model of dynamic resource allocation in workflow systems
20 Citations2004Guido Governatori, Antonino Rotolo +1 more
The proposed approach to modelling agent societies provides a means of reasoning with partial and unpredictable information as is typical of organizational agents in workflow systems.
Lecture notes in computer scienceA Defeasible Logic of Policy-Based Intention
19 Citations2003Guido Governatori, Vineet Padmanabhan
A defeasible logic of intention is outlined that alleviates most of the problems related to logical omniscience and helps in the maintenance of intention-consistency in agent systems like BDI.
Queensland's institutional digital repository (The University of Queensland)A Computational Framework for Non-Monotonic Agency, Institutionalised Power and Multi-Agent Systems
3 Citations2003Guido Governatori, Antonino Rotolo
This work provides a first computational framework to capture some of the theoretical intuitions developed by the present authors and other colleagues and proposes a computationally oriented model of institutional agency based on Defeasible Logic.