Adding disjunction to datalog (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of logic-based abduction
Journal of the ACM (JACM)
Abduction from logic program: semantics and complexity
Theoretical Computer Science
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Answer set programming and plan generation
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Developing a Declarative Rule Language for Applications in Product Configuration
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Considerations on Updates of Logic Programs
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Strong and Weak Constraints in Disjunctive Datalog
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Planning for Distributed Theorem Proving: The Teamwork Approach
KI '96 Proceedings of the 20th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Logic programming with ordered disjunction
Eighteenth national conference on Artificial intelligence
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The Diagnosis Frontend of the dlv system
AI Communications
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Coordination between logical agents
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
| Hi-index | 0.00 |
We present a formalism for logic program cooperation based on the answer set semantics. The system consists of independent logic programs that are connected via a sequential communication channel. When presented with an input set of literals from its predecessor, a logic program computes its output as an answer set of itself, enriched with the input. It turns out that the communication strategy makes the system quite expressive: essentially a sequence of a fixed number of programs n captures the complexity class ${\ensuremath{\Sigma}^P_n}$, i.e. the n-th level of the polynomial hierarchy. On the other hand, unbounded sequences capture the polynomial hierarchy $\mathcal{PH}$. These results make the formalism suitable for complex applications such as hierarchical decision making and preference-based diagnosis on ordered theories. In addition, such systems can be realized by implementing an appropriate control strategy on top of existing solvers such as dlv or smodels, possibly in a distributed environment.