A Complexity Assessment for Queries Involving Sufficient and Necessary Causes

DOI10.1007/978-3-319-11558-0_21zbMath1432.68057OpenAlexW213394602WikidataQ57718985 ScholiaQ57718985MaRDI QIDQ2938502

Jorge Fandiño, Pedro Cabalar, Michael Fink

Publication date: 14 January 2015

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11558-0_21

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (5)

Enablers and Inhibitors in Causal Justifications of Logic Programs ⋮ Justifications for programs with disjunctive and causal-choice rules ⋮ Deriving conclusions from non-monotonic cause-effect relations ⋮ Explaining Preferences and Preferring Explanations ⋮ Answering the “why” in answer set programming – A survey of explanation approaches

Cites Work

• Unnamed Item
• Containment of conjunctive queries on annotated relations
• Justifications for Logic Programming
• Causal Graph Justifications of Logic Programs
• Actual causation in CP-logic
• Enablers and Inhibitors in Causal Justifications of Logic Programs
• Justifications for logic programs under answer set semantics

This page was built for publication: A Complexity Assessment for Queries Involving Sufficient and Necessary Causes