Enabling Reasoning with LegalRuleML

tags
LegalRuleML SPINdle

Notes

NOTER_PAGE: (1 . 0.6631726065688329)
NOTER_PAGE: (2 . 0.21872816212438853)
NOTER_PAGE: (2 . 0.25157232704402516)
NOTER_PAGE: (3 . 0.7449336128581411)

We define a defeasible theory D as a structure (F, R, >), where (i) F is a set of facts or indisputable statements, (ii) R is the set of rules, and (iii) > is an acyclic superiority relation on R.

NOTER_PAGE: (4 . 0.08874912648497554)

DL is a skeptical nonmonotonic logic meaning that it does not support con- tradictory conclusions. Instead, it seeks to resolve conflicts.

NOTER_PAGE: (4 . 0.6156533892382948)

r1 > r2 expresses that r1 overrides r2 if both rules are applicable

NOTER_PAGE: (4 . 0.7260656883298392)

A contract written in LegalRuleML is not intended to be executed directly, but the business logic can be transformed into a target language of a rule-based system to execute.

NOTER_PAGE: (5 . 0.6575821104122991)

ContractLog

NOTER_PAGE: (14 . 0.14325646401118097)

Semantics of Business Vocabulary and Business Rules (SBVR) [24] is an Object Management Group (OMG) standard to represent and fomalise business ontologies, including business rules, facts and business vocabularies.

NOTER_PAGE: (14 . 0.4479385045422781)

semantics for the deontic notions is underspecified.

NOTER_PAGE: (14 . 0.5583508036338225)

SBVR is based on classi- cal first-order-logic, which is not suitable to represent deontic notions and con- flicts. Also, it cannot handle contrary-to-duty obligations

NOTER_PAGE: (14 . 0.5723270440251572)

a theory in LKIF is a set of axioms and defeasible inference rules

NOTER_PAGE: (14 . 0.721174004192872)
NOTER_PAGE: (15 . 0.23689727463312368)