A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Representation results for defeasible logic
ACM Transactions on Computational Logic (TOCL)
Social Order in Multiagent Systems
Social Order in Multiagent Systems
A Flexible Framework for Defeasible Logics
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Action Concepts for Describing Organised Interaction
HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Advanced Technology Track - Volume 5
Open Agent Societies: Normative Specifications in Multi-Agent Systems
Open Agent Societies: Normative Specifications in Multi-Agent Systems
Propositional defeasible logic has linear complexity
Theory and Practice of Logic Programming
Normative autonomy and normative co-ordination: declarative power, representation, and mandate
Artificial Intelligence and Law
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Modal logic investigations in the semantics of counts-as
ICAIL '05 Proceedings of the 10th international conference on Artificial intelligence and law
Temporalised normative positions in defeasible logic
ICAIL '05 Proceedings of the 10th international conference on Artificial intelligence and law
Logical Tools for Modelling Legal Argument: A Study of Defeasible Reasoning in Law
Logical Tools for Modelling Legal Argument: A Study of Defeasible Reasoning in Law
Counts-as: classification or constitution? an answer using modal logic
DEON'06 Proceedings of the 8th international conference on Deontic Logic and Artificial Normative Systems
A semantic web based architecture for e-contracts in defeasible logic
RuleML'05 Proceedings of the First international conference on Rules and Rule Markup Languages for the Semantic Web
BIO logical agents: Norms, beliefs, intentions in defeasible logic
Autonomous Agents and Multi-Agent Systems
Modelling and reasoning languages for social networks policies
EDOC'09 Proceedings of the 13th IEEE international conference on Enterprise Distributed Object Computing
AICOL-I/IVR-XXIV'09 Proceedings of the 2009 international conference on AI approaches to the complexity of legal systems: complex systems, the semantic web, ontologies, argumentation, and dialogue
Rule-based agents, compliance, and intention reconsideration in defeasible logic
RuleML'2011 Proceedings of the 5th international conference on Rule-based reasoning, programming, and applications
Annals of Mathematics and Artificial Intelligence
Possible world semantics for defeasible deontic logic
DEON'12 Proceedings of the 11th international conference on Deontic Logic in Computer Science
A Modal Defeasible Reasoner of Deontic Logic for the Semantic Web
International Journal on Semantic Web & Information Systems
Legal contractions: a logical analysis
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Law
A deontic logic semantics for licenses composition in the web of data
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Law
Computing temporal defeasible logic
RuleML'13 Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web
| Hi-index | 0.00 |
This paper provides a computational framework, based on defeasible logic, to capture some aspects of institutional agency. Our background is Kanger-Lindahl-Pörn account of organised interaction, which describes this interaction within a multi-modal logical setting. This work focuses in particular on the notions of counts-as link and on those of attempt and of personal and direct action to realise states of affairs. We show how standard defeasible logic (DL) can be extended to represent these concepts: the resulting system preserves some basic properties commonly attributed to them. In addition, the framework enjoys nice computational properties, as it turns out that the extension of any theory can be computed in time linear to the size of the theory itself.