Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results

DOI10.1007/s10472-007-9069-yzbMath1129.68084OpenAlexW1877903941MaRDI QIDQ2385448

Gianluigi Greco

Publication date: 12 October 2007

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-007-9069-y

zbMATH Keywords

Nonmonotonic reasoningAbductionData integration

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17) Distributed systems (68M14)

Uses Software

• LAILA
• IMPACT
• Smodels
• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending answer sets for logic programming agents
• Approximating cost-based abduction is NP-hard
• Heterogeneous active agents, I: Semantics
• Succinctness as a source of complexity in logical formalisms
• Cost-based abduction and MAP explanation
• Negotiation and cooperation in multi-agent environments
• Fusion of multi-agent preference orderings
• Cooperation and competition in ALIAS: A logic framework for agents that negotiate
• Non-cooperative games
• On the Relationship Between Abduction and Deduction
• LAILA: a language for coordinating abductive reasoning among logic agents
• The complexity of logic-based abduction
• Abductive logic programs with penalization: semantics, complexity and implementation
• Answer sets for consistent query answering in inconsistent databases
• Logic Programming
• Logic Programming
• Logics in Artificial Intelligence
• Computational Logic in Multi-Agent Systems
• Computational Logic in Multi-Agent Systems
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty