Journal of Computer and System Sciences
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Agent theories, architectures, and languages: a survey
ECAI-94 Proceedings of the workshop on agent theories, architectures, and languages on Intelligent agents
ACM Transactions on Database Systems (TODS)
Prioritized conflict handing for logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Formalizing the cooperative problem solving process
Readings in agents
The expressive powers of the logic programming semantics (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
From logic programming towards multi-agent systems
Annals of Mathematics and Artificial Intelligence
Semantics and expressiveness of disjunctive ordered logic
Annals of Mathematics and Artificial Intelligence
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
A Deliberative and Reactive Diagnosis Agent Based on Logic Programming
ATAL '97 Proceedings of the 4th International Workshop on Intelligent Agents IV, Agent Theories, Architectures, and Languages
The PARK Semantics for Active Rules
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Solving abduction by computing joint explanations
Annals of Mathematics and Artificial Intelligence
Coordination in answer set programming
ACM Transactions on Computational Logic (TOCL)
A Logic Language with Stable Model Semantics for Social Reasoning
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Logic programming with social features1
Theory and Practice of Logic Programming
Merging Logic Programs under Answer Set Semantics
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Hierarchical decision making in multi-agent systems using answer set programming
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
Answer set programming for representing and reasoning about virtual institutions
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
Constructing consensus logic programs
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
A 25-year perspective on logic programming
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Automatic music composition using answer set programming
Theory and Practice of Logic Programming
Query-driven coordination of multiple answer sets
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
ASTREA: answer sets for a trusted reasoning environment for agents
Logic programming, knowledge representation, and nonmonotonic reasoning
A social semantics for multi-agent systems
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Combining answer sets of nonmonotonic logic programs
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
A Model-Theoretic Approach to Belief Change in Answer Set Programming
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We assume the requirements or desires of an agent are modeled by a logic program. In a multi-agent setting, a joint decision of the agents, reflecting a compromise of the various requirements, corresponds to a suitable joint model of the respective logic programs. In this paper, an appropriate semantics for selecting joint models representing compromises is proposed: the joint fixpoint semantics. The intended joint models are defined to be the (minimal) joint fixpoints of the agent programs. We study computational properties of this new semantics showing that determining whether two (or more) logic programs have a joint fixpoint is NP complete. This remains true even for entirely positive logic programs. We also study the complexity of skeptical and credulous reasoning under the joint fixpoint semantics. The former is proven to be co-NP complete, while the latter is 驴2P complete. We show how the joint fixpoints of a set of logic programs can be computed as stable sets.