Syntactical characterization of a subset of domain-independent formulas
Journal of the ACM (JACM)
Refinement of knowledge bases based on consistency
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Linear resolution for consequence finding
Artificial Intelligence
Deontic logic: a concise overview
Deontic logic in computer science
A completeness theorem and a computer program for finding theorems derivable from given axioms
A completeness theorem and a computer program for finding theorems derivable from given axioms
Metatheory of actions: Beyond consistency
Artificial Intelligence
Reasoning with an Incomplete Information Exchange Policy
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Elaborating domain descriptions
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
How to Complete Regulations in Multi-agent Systems
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
This paper addresses the problem of regulation consistency checking. Regulations are sets of rules which express what is obligatory, permitted, forbidden and under which conditions. We first define a first order language to model regulations. Then we introduce a definition of regulation consistency. We show that checking the consistency of a regulation comes to generate some particular consequences of some first order formulas. Then, we show that we can apply Inoue's inference rule, SOL-resolution, which is complete for generating, from some clauses, their consequences which satisfy a given condition.