T. Eiter and G. Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1):3--42, January 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Algorithms for Logic-Based Abduction - Anja Remshagen And (Correct)
....We want to find an explanation, given as a truth assignment for the variables of Q, which is consistent with R but not with . We refer to this problem as Q ALL SAT. Transformations show that Q ALL SAT is logically equivalent to the propo sitional abduction problem defined by Eiter and Gottlob [3]. Thus, Q ALL SAT is H complete. We also encounter the problem where a cost is associated with the truth assignment to each variable in R, and an explanation inducing minimum total cost is searched for. Eiter and Gottlob [3] proved that an equivalent form of this problem is A complete. A third ....
....to the propo sitional abduction problem defined by Eiter and Gottlob [3] Thus, Q ALL SAT is H complete. We also encounter the problem where a cost is associated with the truth assignment to each variable in R, and an explanation inducing minimum total cost is searched for. Eiter and Gottlob [3] proved that an equivalent form of this problem is A complete. A third problem considers worst case scenarios. We want to determine the minimum cost of a cure or repair in the worst possible case. Here a truth assignment consistent with represents a possible cure or repair. A cost is associated ....
Eiter, T., Gottlob, G.:, The Complexity of Logic-based Abduction. Journal of the Association for Computing Machinery 42, (1995) 3-42
Enhancing Model Checking in Verification by AI Techniques - Buccafurri, Eiter.. (1999) (2 citations) Self-citation (Eiter Gottlob) (Correct)
No context found.
Eiter, T., Gottlob, G., The Complexity of Logic-Based Abduction, Journal of the ACM, 42(1):3--42, 1995.
Abduction and the Dualization Problem - Eiter, Makino (2003) Self-citation (Eiter) (Correct)
No context found.
T. Eiter and G. Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1):3--42, January 1995.
Complexity Results for Explanations in the Structural-Model.. - Eiter, Lukasiewicz (2002) Self-citation (Eiter) (Correct)
No context found.
T. Eiter and G. Gottlob. The complexity of logic-based abduction. J. ACM, 42(1):3--42, January 1995.
A Deductive System for - Non-Monotonic Reasoning Thomas Self-citation (Eiter) (Correct)
No context found.
T. Eiter and G. Gottlob. The Complexity of Logic-Based Abduction. JACM, 42(1):3--42, January 1995.
Complexity Results for Explanations in the Structural-Model.. - Eiter, Lukasiewicz (2002) Self-citation (Eiter) (Correct)
....or natural language processing to mention but a few. One of the uses of abduction is to obtain explanations for observations, which loosely speaking is accomplished by a kind of reversed modus ponens. There is quite some work on algorithms and complexity of finding abductive explanations (e.g. [4, 8, 9, 11, 43, 46]) Roughly, in a logic based setting, abductive explanations are defined as follows (cf. 34, 46] Given some background knowledge , which is a theory, i.e. a set of sentences in some logic, and a set of observations , which are typically facts, a set of sentences from a set of ....
....in a standard logical setting such as above, are apparently different concepts, they have similar complexity. In particular, deciding the existence of an abductive explanation in the propositional context (i.e. are in classical propositional logic) is complete, as shown in [11]. This matches our respective result on causal explanations for binary causal models. In fact, computing causal explanations can be polynomially transformed into computing abductive explanations in this case, and vice versa. In the case of causal models with non binary domains, explanations are ....
T. Eiter and G. Gottlob. The complexity of logic-based abduction. J. ACM, 42(1):3--42, 1995.
Generating all Abductive Explanations for Queries on.. - Eiter, Makino (2003) Self-citation (Eiter) (Correct)
....disciplines, where it has been recognized as an important principle of commonsense reasoning (see e.g. 3] Abduction has applications in many areas of AI and Computer Science including diagnosis, database updates, planning, natural language understanding, learning etc. see e.g. references in [10]) where it is primarily used for generating explanations. In a logic based setting, abduction can be viewed as the task to find, given a set of formulas (the background theory) and a formula (the query) a minimal set of formulas E (an explanation) from a set of hypotheses H such that ....
....and by the Scientific Grant in Aid of the Ministry of Education, Science, Sports, Culture and Technology of Japan. and logically entails . Often considered is a scenario where is a propositional Horn theory, is a single literal or a conjunction of literals, and H contains literals (see [24, 10] and references therein) For use in practice, the computation of abductive explanations in this setting is an important problem, for which well known early systems such as Theorist [20] or ATMS solvers [6, 22] have been devised. Since then, there has been a growing literature on this subject, ....
[Article contains additional citation context not shown here]
T. Eiter and G. Gottlob. The complexity of logic-based abduction. JACM, 42(1):3--42, 1995.
Generating all Abductive Explanations for Queries on.. - Eiter, Makino (2003) Self-citation (Eiter) (Correct)
....disciplines, where it has been recognized as an important principle of common sense reasoning (see e.g. 3] Abduction has applications in many areas of AI and Computer Science including diagnosis, database updates, planning, natural language understanding, learning etc. see e.g. references in [10]) where it is primarily used for generating explanations. In a logic based setting, abduction can be viewed as the task to find, given a set of formulas (the background theory) and a formula (the query) a minimal set of formulas E (an explanation) from a set of hypotheses H such that plus ....
.... (the query) a minimal set of formulas E (an explanation) from a set of hypotheses H such that plus E is satisfiable and logically entails . Often considered is a scenario where is a propositional Horn theory, is a single literal or a conjunction of literals, and H contains literals (see [23, 10] and references therein) For use in practice, the computation of abductive explanations in this setting is an important problem, for which well known early systems such as Theorist [19] or ATMS solvers [6, 21] have been devised. Since then, there has been a growing literature on this subject, ....
[Article contains additional citation context not shown here]
T. Eiter and G. Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1):3--42, 1995.
An Abduction-based Method for Index - Relaxation In Taxonomy-Based (2003) (Correct)
No context found.
T. Eiter and G. Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1):3--42, January 1995.
A Unifying Framework for Flexible Information - Access In Taxonomy-Based (2004) (Correct)
No context found.
T. Eiter and G. Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1):3--42, January 1995.
Abductive Theorem Proving for Analyzing Student.. - Makatchev, Jordan.. (2004) (Correct)
No context found.
Eiter, T. and G. Gottlob: 1993, `The Complexity of Logic-Based Abduction'. In: Symposium on Theoretical Aspects of Computer Science. pp. 70--79.
Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) (Correct)
No context found.
Thomas Eiter and Georg Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1):3--42, 1995.
Ordered Programs as Abductive Systems - Van Nieuwenborgh, Vermeir (2003) (Correct)
No context found.
Thomas Eiter and Georg Gottlob. The complexity of logic-based abduction. Journal of the Association for Computing Machinery, 42(1):3--42, 1995.
Ordered Diagnosis - Van Nieuwenborgh, Vermeir (2003) (Correct)
No context found.
Thomas Eiter and Georg Gottlob. The complexity of logic-based abduction. Journal of the Association for Computing Machinery, 42(1):3--42, 1995.
An Abduction-based Method for Index Relaxation in.. - Meghini, Tzitzikas.. (2003) (Correct)
No context found.
T. Eiter and G. Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1):3--42, January 1995.
A Unifying Framework for Flexible Information Access.. - Tzitzikas, Meghini.. (2004) (Correct)
No context found.
T. Eiter and G. Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1):3--42, January 1995.
An Abduction-based Method for Index Relaxation in.. - Meghini, Tzitzikas.. (2003) (Correct)
No context found.
T. Eiter and G. Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1):3--42, January 1995.
Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) (Correct)
No context found.
Thomas Eiter and Georg Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1):3--42, 1995.
A Classification and Survey of Preference Handling.. - Delgrande, Schaub, al. (Correct)
No context found.
T. Eiter and G. Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42:3--42, 1995.
Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) (Correct)
No context found.
Thomas Eiter and Georg Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1):3--42, 1995.
Explaining Incompatibilities in Data Dictionary - Design Through Abduction (Correct)
No context found.
T. Eiter and G. Gottlob. The complexity of logic-based abduction. In Symposium of Theoretical aspects of Computer Science, pages 170--180. Springer Verlag, 1993.
Outlier Detection Using Default Logic - Angiulli, Ben-Eliyahu-Zohary.. (2003) (Correct)
No context found.
Thomas Eiter and Georg Gottlob. The complexity of logic-based abduction. JACM, 42(1):3-- 42, 1995.
Outlier Detection Using Default Logic - Fabrizio, Ben-Eliyahu-Zohary.. (2003) (Correct)
No context found.
Thomas Eiter and Georg Gottlob. The complexity of logic-based abduction. JACM, 42(1):3-- 42, 1995.
Man Bites Dog: Looking for Interesting Inconsistencies in.. - Byrne, Hunter (2003) (Correct)
No context found.
T Eiter and G Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42:3--42, 1995.
AI Approaches to Network Management: Recent Advances and A.. - Kumar, Venkataram (Correct)
No context found.
T. Eiter and G. Gottlab, The Complexity of Logic Based Abduction, Jl. of the ACM, 42(1), pp.3-42, January 1995.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC