REPRESENTING BUSINESS CONTRACTS IN<i>RuleML</i>
International Journal of Cooperative Information SystemsPublished 1 June 2005
Guido Governatori
Citations243
SJR quartileQ3
SJR score0.27
SNIP0.64
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 presents an approach for the specification and implementation of translating contracts from a human-oriented form into an executable representation for monitoring in the setting of RuleML, and how to extend it to cover deontic and defeasible aspects of legal language.
Abstract
This paper presents an approach for the specification and implementation of translating contracts from a human-oriented form into an executable representation for monitoring. This will be done in the setting of RuleML. The task of monitoring contract execution and performance requires a logical account of deontic and defeasible aspects of legal language; currently such aspects are not covered by RuleML; accordingly we show how to extend it to cover such notions. From its logical form, the contract will thus be transformed into a machine readable rule notation and eventually implemented as executable semantics via any mark-up languages depending on the client's preference, for contract monitoring purposes.
Keywords
Computer ScienceSocial Sciences
Artificial IntelligenceA mathematical treatment of defeasible reasoning and its implementation
549 Citations1992Guillermo Ricardo Simari, Ronald P. Loui
This thesis presents a formally precise, elegant, clean, well-defined system which exhibits a correct behavior when applied to the benchmark examples in the literature and represents a definite improvement over past systems.
Logic Journal of IGPLA Formal Characterisation of Institutionalised Power
470 Citations1996Andrew Jones, Marek Sergot
This work distinguishes institutionalised power from permission and practical possibility, and develops a conditional connective intended to capture the consequence relation implicit in statements of the form that facilitates the analysis of a number of notions crucial to the understanding of organised interaction in institutions.
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 Intelligence and LawA dialectical model of assessing conflicting arguments in legal reasoning
335 Citations1996Henry Prakken, Giovanni Sartor
This approach complements two other lines of research in AI and Law, investigations of precedent-based reasoning and the development of ‘procedural’, or ‘dialectical’ models of legal argument.
Journal of Logic and ComputationArgumentation Semantics for Defeasible Logic
249 Citations2004Guido Governatori
Dung-like argumentation semantics is provided for two key defeasible logics, of which one is ambiguity propagating and the other ambiguity blocking, which provides the first ambiguity blocking Dung- like argumentation system.
Deontic Logic and Contrary-to-Duties
246 Citations2002José Carmo, Andrew Jones
The “AEON” workshop proceedings provide some illustrations of work in these areas of deontic logic, pertaining for example to the responsibilities and powers which agents are required or authorised to exercise.
A Declarative Approach to Business Rules in Contracts: Courteous Logic Programs in XML
156 Citations2011Benjamin N. Grosof, Yannis Labrou +1 more
Defeasible Deontic Logic
156 Citations1997Donald Nute
These papers explore the applicability of nonmonotonic or defeasible logic to normative reasoning and the resulting systems purport to solve well-known deontic paradoxes and to provide a better treatment of prima facie obligation, conditional obligation, and priorities of normative principles.
Literary and Linguistic ComputingJournal of Logic Programming
155 Citations1993Maurice Bruynooghe, James A. Robinson
Design Rationale for RuleML: A Markup Language for Semantic Web Rules.
137 Citations2001Harold Boley, Said Tabet +1 more
The design rationale of RuleML, a rule markup language for the Semantic Web, and the modular syntax and semantics and the current RuleML 0.8 DTDs are presented.
International Journal of Artificial Intelligence ToolsEFFICIENT DEFEASIBLE REASONING SYSTEMS
120 Citations2001Michael J. Maher, Andrew Rock +3 more
A Declarative Debugging Scheme.
111 Citations1997Lee Naish
By using declarative semantics of programs, the debugger is able to hide complex execution mechanisms such as uni(cid:12)cation, backtracking, coroutining, parallelism, higher order functions, lazy evaluation, message passing and inheritance.
arXiv (Cornell University)A flexible framework for defeasible logics
109 Citations2000Grigoris Antoniou, David P. Billington +2 more
Lecture notes in computer scienceWell-Founded Semantics for Description Logic Programs in the Semantic Web
108 Citations2004Thomas Eiter, Thomas Lukasiewicz +2 more
SweetDeal
104 Citations2003Benjamin N. Grosof, T.C. Poon
This system is the first to combine emerging Semantic Web standards for knowledge representation of rules (RuleML) with ontologies (DAML+OIL) with ontologies (DAML+OIL) for a practical e-business application domain and further to do so with process knowledge.
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.
The Journal of Logic ProgrammingDefeasible logic versus Logic Programming without Negation as Failure
97 Citations2000Grigoris Antoniou, Michael J. Maher +1 more
This paper compares the expressive power of two approaches in this family of logics: Defeasible Logic, and sceptical Logic Programming without Negation as Failure (LPwNF), showing that the former has a strictly stronger expressive power.
Electronic Commerce Research and ApplicationsRepresenting e-commerce rules via situated courteous logic programs in RuleML
85 Citations2003Benjamin N. Grosof
This work extends, for the first time, RuleML’s definition from the ordinary logic programs KR to situated courteous logic programs (SCLP), an expressively general KR that supports prioritized conflict handling and procedural attachments for actions and queries.
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.
Communications of the ACMThe eXtensible Rule Markup Language
75 Citations2003Jae Kyu Lee, Mye Sohn
XRML explicates the rules implicitly embedded in Web pages, enabling software agents to process the rules automatically.
Obligations directed from bearers to counterparts
66 Citations1995Henning Herrestad, Christen Krogh
A logical analysis of the concepts of directed obligation, prohibition and permission is provided, discussed in view of two competing theories of rights: the benefit theory and the claimant theory.
The Many Faces of Defeasibility in Defeasible Deontic Logic
65 Citations1997Leendert van der Torre, Yao‐Hua Tan
This article analyzes this overlap between deontic and defeasibility aspects, and shows that this confusion can be avoided if one makes the proper distinctions between different types of defeasible logic.
Artificial Intelligence and LawNormative autonomy and normative co-ordination: Declarative power, representation, and mandate
63 Citations2004Jonathan Gelati, Antonino Rotolo +2 more
This paper explains the idea of declarative power, which consists in the capacity of the power-holder of creating normative positions, involving other agents, simply by „proclaiming“ such positions.
Lecture notes in computer scienceDR-DEVICE: A Defeasible Logic System for the Semantic Web
62 Citations2004Nick Bassiliades, Grigoris Antoniou +1 more
The DR-DEVICE system is presented, which is capable of reasoning about RDF data over multiple Web sources using defeasible logic rules, and includes a use case of a semantic web broker that reasons defeasibly about renting apartments based on buyer's requirements and seller’s advertisements.
How to Design a General Rule Markup Language
58 Citations2002Gerd Wagner
The problem of how to design a General Rule Markup Language that can be used for enriching XML/RDF-based taxonomies and publishing the reactive behavior of a system in the form of reaction rules is considered.
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.
1 On design and implementation of a contract monitoring facility
41 Citations2004Zoran Milošević, S. Gibson +3 more
A solution to the problem of designing and implementing a contract monitoring facility as part of a larger cross-organisational contract management architecture is presented.
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.
Representing Agent Contracts with Exceptions using XML Rules, Ontologies, and Process Descriptions.
36 Citations2002Benjamin N. Grosof, T.C. Poon
This work newly extends the Sweet-Deal approach by also incorporating process knowledge descriptions whose ontologies are represented in DAML+OIL, thereby enabling more complex contracts with behavioral provisions, especially for handling exception conditions that might arise during the execution of the contract.
Lecture notes in computer scienceDefeasible Description Logics
31 Citations2004Guido Governatori
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.
International Journal of Law and Information TechnologyArtificial Intelligence and Law
29 Citations1994António A. Martino
Interaction patterns and observable commitments in a multi-agent trading scenario
29 Citations2001Jeremy Pitt, Lloyd Kamara +1 more
This work proposes a formal semantics for the protocol diagrams (interaction patterns) of AUML and shows that protocol diagrams should be parameterised with observable commitments: additional specification of the expected outcomes and normative positions resulting from the use of the protocol.
Lecture notes in computer scienceA System for Nonmonotonic Rules on the Web
20 Citations2004Grigoris Antoniou, Antonis Bikakis +1 more
This paper reports on the implementation of a system for defeasible reasoning on the Web that is syntactically compatible with RuleML, based on a translation to logic programming with declarative semantics, and flexible and adaptable to different intuitions within defeasibility reasoning.
A Gentzen System for Reasoning with Contrary-To-Duty Obligations: A Preliminary Study
15 Citations2002Guido Governatori, Antonino Rotolo
A Gentzen system for reasoning with contrary-to-duty obligations is presented based on the definition of a new non-classical connective capturing the notion of reparational obligation and tested against well-known contrary- to-duty paradoxes.
International Journal of Intelligent SystemsDefeasible logic with dynamic priorities
14 Citations2004Grigoris Antoniou
This article shows how dynamic priorities can be integrated, where priority information is obtained from the deductive process itself, and defines a proof theory, study its formal properties, and provide an argumentation semantics.