Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Representation results for defeasible logic
ACM Transactions on Computational Logic (TOCL)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Flexible Framework for Defeasible Logics
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Towards Socially Sophisticated BDI Agents
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Propositional defeasible logic has linear complexity
Theory and Practice of Logic Programming
Preferences of agents in defeasible logic
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Programming cognitive agents in defeasible logic
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Strategic argumentation: a game theoretical investigation
Proceedings of the 11th international conference on Artificial intelligence and law
Contextual deliberation of cognitive agents in defeasible logic
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
BIO logical agents: Norms, beliefs, intentions in defeasible logic
Autonomous Agents and Multi-Agent Systems
A computational framework for institutional agency
Artificial Intelligence and Law
Contextual Agent Deliberation in Defeasible Logic
Agent Computing and Multi-Agent Systems
An Asymmetric Protocol for Argumentation Games in Defeasible Logic
Agent Computing and Multi-Agent Systems
Temporal extensions to defeasible logic
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Dialogue games in defeasible logic
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |
In this paper we follow the BOID (Belief, Obligation, Intention, Desire) architecture to describe agents and agent types in Defeasible Logic. We argue that the introduction of obligations can provide a new reading of the concepts of intention and intentionality. Then we examine the notion of social agent (i.e., an agent where obligations prevail over intentions) and discuss some computational and philosophical issues related to it. We show that the notion of social agent either requires more complex computations or has some philosophical drawbacks.