Complexity results for explanations in the structural-model approach

&
Artificial Intelligence 154 (1-2):145-198 (2004)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2003.06.002

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Causes and explanations in the structural-model approach: Tractable cases.Thomas Eiter & Thomas Lukasiewicz - 2006 - Artificial Intelligence 170 (6-7):542-580.
Thomas F. Gordon, The Pleadings Game – An Artificial Intelligence Model of Procedural Justice. [REVIEW]Arno R. Lodder - 2000 - Artificial Intelligence and Law 8 (2-3):255-264.
Thomas F. Gordon, the pleadings game – an artificial intelligence model of procedural justice.Arno R. Lodder - 2000 - Artificial Intelligence and Law 8 (2-3):255-264.
State-variable planning under structural restrictions: algorithms and complexity.Peter Jonsson & Christer Bäckström - 1998 - Artificial Intelligence 100 (1-2):125-176.
Foundations of explanations as model reconciliation.Sarath Sreedharan, Tathagata Chakraborti & Subbarao Kambhampati - 2021 - Artificial Intelligence 301 (C):103558.
The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions.Valeria Fionda & Gianluigi Greco - 2013 - Artificial Intelligence 196 (C):1-25.
Algorithms and complexity results for persuasive argumentation.Eun Jung Kim, Sebastian Ordyniak & Stefan Szeider - 2011 - Artificial Intelligence 175 (9-10):1722-1736.
Łukasiewicz logics for cooperative games.Enrico Marchioni & Michael Wooldridge - 2019 - Artificial Intelligence 275 (C):252-278.
Complexity results for structure-based causality.Thomas Eiter & Thomas Lukasiewicz - 2002 - Artificial Intelligence 142 (1):53-89.

Analytics

Added to PP
2020-12-22

Downloads
14 (#1,272,601)

6 months
4 (#1,246,434)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.
A logic of universal causation.Hudson Turner - 1999 - Artificial Intelligence 113 (1-2):87-123.

View all 13 references / Add more references